Sciweavers

16666 search results - page 2971 / 3334
» Descriptive and Computational Complexity
Sort
View
CORR
2002
Springer
79views Education» more  CORR 2002»
15 years 6 months ago
Optimally cutting a surface into a disk
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
Jeff Erickson, Sariel Har-Peled
188
Voted
ENDM
2000
116views more  ENDM 2000»
15 years 6 months ago
Conceptual Models for Combined Planning and Scheduling
Planning and scheduling attracts an unceasing attention of computer science community. Several research areas like Artificial Intelligence, Operations Research and Constraint Prog...
Roman Barták
FGCS
2000
81views more  FGCS 2000»
15 years 6 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
FUIN
2000
71views more  FUIN 2000»
15 years 6 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
GPEM
2000
126views more  GPEM 2000»
15 years 6 months ago
Automatic Creation of Human-Competitive Programs and Controllers by Means of Genetic Programming
Genetic programming is an automatic method for creating a computer program or other complex structure to solve a problem. This paper first reviews various instances where genetic p...
John R. Koza, Martin A. Keane, Jessen Yu, Forrest ...
« Prev « First page 2971 / 3334 Last » Next »