Sciweavers

17541 search results - page 3155 / 3509
» Complexity in scalable computing
Sort
View
CORR
2002
Springer
104views Education» more  CORR 2002»
15 years 6 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
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
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
CORR
2002
Springer
74views Education» more  CORR 2002»
15 years 6 months ago
A logical reconstruction of SPKI
SPKI/SDSI is a proposed public key infrastructure standard that incorporates the SDSI public key infrastructure. SDSI's key innovation was the use of local names. We previous...
Joseph Y. Halpern, Ron van der Meyden
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
« Prev « First page 3155 / 3509 Last » Next »