10608 search results - page 491 / 2122 » Complexity of O'Hara's Algorithm |
181
click to vote
COMPGEOM
2006
ACM
16 years 28 days ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
174
click to vote
ICDCS
2005
IEEE
16 years 17 days ago
2005
IEEE
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
202
click to vote
TAMC
2010
Springer
16 years 1 days ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
175
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
180
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...