8647 search results - page 561 / 1730 » The Container Selection Problem |
183
click to vote
SIGACT
2008
15 years 7 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
181
Voted
TOPLAS
2008
15 years 7 months ago
2008
Current critical systems often use a lot of floating-point computations, and thus the testing or static analysis of programs containing floatingpoint operators has become a priori...
168
click to vote
DM
2002
15 years 6 months ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
193
click to vote
IPL
2007
15 years 6 months ago
2007
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
150
click to vote
AUTOMATICA
1999
15 years 6 months ago
1999
This paper considers the problem of balanced model reduction for a class of distributed parameter systems. The system is assumed to have a finite-dimensional state vector as well ...