Sciweavers

5692 search results - page 10 / 1139
» Challenges and Unsolved Problems
Sort
View
CORR
2006
Springer
94views Education» more  CORR 2006»
13 years 6 months ago
Epsilon-Unfolding Orthogonal Polyhedra
Abstract. An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). ...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
FUIN
2007
100views more  FUIN 2007»
13 years 6 months ago
An Algebraic Characterization of the Halting Probability
Using 1947 work of Post showing that the word problem for semigroups is unsolvable, we explicitly exhibit an algebraic characterization of the bits of the halting probability Ω....
Gregory J. Chaitin
ANOR
2008
171views more  ANOR 2008»
13 years 6 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
14 years 3 days ago
Comparing Discrete and Continuous Genotypes on the Constrained Portfolio Selection Problem
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
Felix Streichert, Holger Ulmer, Andreas Zell
SOFSEM
2010
Springer
14 years 3 months ago
Clock Synchronization: Open Problems in Theory and Practice
Clock synchronization is one of the most basic building blocks for many applications in computer science and engineering. The purpose of clock synchronization is to provide the con...
Christoph Lenzen, Thomas Locher, Philipp Sommer, R...