Sciweavers

1844 search results - page 257 / 369
» Exploiting the Structure of Distributed Constraint Optimizat...
Sort
View
MST
2006
136views more  MST 2006»
15 years 4 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
ANCS
2005
ACM
15 years 10 months ago
Resource mapping and scheduling for heterogeneous network processor systems
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinh...
130
Voted
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 10 months ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 8 months ago
A combinatorial genetic algorithm for the configuration of the 2dF/AAOmega spectrograph at the anglo-Australian observatory
To help unravel the structure of the universe, astronomers have developed systems which observe large clusters of objects at the same time. One such system is the 2-degree field s...
Steven Manos, Geraint Lewis
ICTAI
2005
IEEE
15 years 10 months ago
Planning with POMDPs Using a Compact, Logic-Based Representation
Partially Observable Markov Decision Processes (POMDPs) provide a general framework for AI planning, but they lack the structure for representing real world planning problems in a...
Chenggang Wang, James G. Schmolze