Sciweavers

13987 search results - page 246 / 2798
» The Two Guards Problem
Sort
View
GECCO
2009
Springer
116views Optimization» more  GECCO 2009»
15 years 8 months ago
String- and permutation-coded genetic algorithms for the static weapon-target assignment problem
In the Weapon-Target Assignment Problem, m enemy targets are inbound, each with a value Vj representing the damage it may do. The defense has n weapons, and the probability that w...
Bryant A. Julstrom
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 8 months ago
A Unified Approach to Approximating Partial Covering Problems
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
Jochen Könemann, Ojas Parekh, Danny Segev
WSC
2008
15 years 6 months ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
CCCG
2010
15 years 5 months ago
Approximating the independent domatic partition problem in random geometric graphs - an experimental study
We investigate experimentally the Domatic Partition (DP) problem, the Independent Domatic Partition (IDP) problem and the Idomatic partition problem in Random Geometric Graphs (RG...
Dhia Mahjoub, Angelika Leskovskaya, David W. Matul...
AAAI
1996
15 years 5 months ago
Deciding to Remind During Collaborative Problem Solving: Empirical Evidence for Agent Strategies
Previous work suggests that reminding a conversational partner of mutually known information depends on the conversants' attentional state, their resource limits and the reso...
Pamela W. Jordan, Marilyn A. Walker