4066 search results - page 412 / 814 » Almost Complete Sets |
184
click to vote
SPAA
2005
ACM
16 years 12 days ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
203
click to vote
KR
2010
Springer
15 years 11 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
164
click to vote
ICRA
2000
IEEE
15 years 11 months ago
2000
IEEE
We present an approach for automatically generating complete process plans, including xturing and CNC code, from high level shape feature part descriptions. The demonstration syst...
216
click to vote
DBPL
1997
Springer
15 years 11 months ago
1997
Springer
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...
174
click to vote
EJC
2008
15 years 7 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...