10988 search results - page 1730 / 2198 » Algorithmic Folding Complexity |
179
click to vote
ATAL
2007
Springer
16 years 15 days ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
160
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
164
click to vote
GECCO
2007
Springer
16 years 15 days ago
2007
Springer
This paper introduces a procedure for using genetic multiobjective optimization in yacht design. The problem described consists on the optimization of a bulb shape to improve the ...
206
click to vote
IPSN
2007
Springer
16 years 14 days ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
159
Voted
FOCS
2006
IEEE
16 years 11 days ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...