3172 search results - page 165 / 635 » On the Random-Self-Reducibility of Complete Sets |
164
click to vote
ICPP
2006
IEEE
16 years 16 days ago
2006
IEEE
These days an increasing number of applications, especially in science and engineering, are dealing with a massive amount of data; hence they are dataintensive. Bioinformatics, da...
159
click to vote
ASPDAC
2005
ACM
16 years 2 days ago
2005
ACM
To handle modern routing with nanometer effects, we need to consider designs of variable wire widths and spacings, for which gridless routers are desirable due to their great fle...
176
click to vote
SPAA
2005
ACM
16 years 1 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...
192
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...
156
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...