1277 search results - page 76 / 256 » Terminating Decision Algorithms Optimally |
134
click to vote
DAC
2008
ACM
16 years 4 months ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
250
click to vote
SIGIR
2011
ACM
14 years 6 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
142
click to vote
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Inspired originally by the Learnable Evolution Model(LEM) [5], we investigate LEM(ID3), a hybrid of evolutionary search with ID3 decision tree learning. LEM(ID3) involves interleav...
161
click to vote
DMSN
2006
ACM
15 years 9 months ago
2006
ACM
In this paper, we study the problem of processing multiple queries in a wireless sensor network. We focus on multiquery optimization at the base station level to minimize the numb...
133
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...