|
Journals in DBLP
- Daniel R. Dooly, Sally A. Goldman, Stephen Kwek
Real-valued multiple-instance learning with queries. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:1-15 [Journal]
- Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
An improved approximation algorithm for vertex cover with hard capacities. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:16-33 [Journal]
- Jörg Flum, Martin Grohe, Mark Weyer
Bounded fixed-parameter tractability and log2n nondeterministic bits. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:34-71 [Journal]
- Roni Khardon, Marta Arias
The subsumption lattice and query learning. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:72-94 [Journal]
- Marcus Hutter
Sequential predictions based on algorithmic complexity. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:95-117 [Journal]
- Matthew Andrews, Lisa Zhang
Minimizing maximum fiber requirement in optical networks. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:118-131 [Journal]
- Leah Epstein, Tamir Tassa
Optimal preemptive scheduling for general target functions. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:132-162 [Journal]
- Pierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer
The many faces of a translation. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:163-179 [Journal]
- Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:1, pp:180-203 [Journal]
|