Sciweavers

211 search results - page 16 / 43
» Solving Games Without Determinization
Sort
View
AAMAS
2002
Springer
14 years 10 months ago
Adapting Populations of Agents
We control a population of interacting software agents. The agents have a strategy, and receive a payoff for executing that strategy. Unsuccessful agents become extinct. We investi...
Philippe De Wilde, Maria Chli, Luís Correia...
DAC
1999
ACM
15 years 2 months ago
Crosstalk Minimization Using Wire Perturbations
We study the variation of the crosstalk in a net and its neighbors when one of its trunks is perturbed, showing that the trunk’s perturbation range can be efficiently divided i...
Prashant Saxena, C. L. Liu
ATAL
2010
Springer
14 years 11 months ago
A graph-theoretic approach to protect static and moving targets from adversaries
The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack t...
John P. Dickerson, Gerardo I. Simari, V. S. Subrah...
SOFSEM
2012
Springer
13 years 6 months ago
Recent Challenges and Ideas in Temporal Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
Orna Kupferman
CISS
2007
IEEE
15 years 4 months ago
Sensor Location through Linear Programming with Arrival Angle Constraints
Abstract— In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Beside...
Camillo Gentile, John Shiu