3946 search results - page 338 / 790 » The computational complexity of choice sets |
183
click to vote
VEE
2009
ACM
16 years 1 months ago
2009
ACM
Today’s web applications are pushing the limits of modern web browsers. The emergence of the browser as the platform of choice for rich client-side applications has shifted the ...
171
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
197
click to vote
ICAS
2006
IEEE
16 years 27 days ago
2006
IEEE
The size, complexity, heterogeneity, and dynamism of largescale computational grids make autonomic grid services and solutions necessary. In particular, grid schedulers must map a...
179
click to vote
SIGCOMM
2006
ACM
16 years 24 days ago
2006
ACM
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
254
click to vote
ISPD
2005
ACM
16 years 12 days ago
2005
ACM
Placement is a critical component of today's physical synthesis flow with tremendous impact on the final performance of VLSI designs. However, it accounts for a significant p...