22 search results - page 4 / 5 » Cooperative search for optimizing pipeline operations |
VLDB
2002
ACM
13 years 6 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...
INFOCOM
2006
IEEE
14 years 11 days ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
GECCO
2006
Springer
13 years 10 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
AI
2010
Springer
13 years 6 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
LCTRTS
2004
Springer
13 years 11 months ago
2004
Springer
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...