Sciweavers

428 search results - page 41 / 86
» An asynchronous complete method for distributed constraint o...
Sort
View
JSAC
2008
140views more  JSAC 2008»
15 years 3 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
ATAL
2007
Springer
15 years 9 months ago
On opportunistic techniques for solving decentralized Markov decision processes with temporal constraints
Decentralized Markov Decision Processes (DEC-MDPs) are a popular model of agent-coordination problems in domains with uncertainty and time constraints but very difficult to solve...
Janusz Marecki, Milind Tambe
IAJIT
2008
134views more  IAJIT 2008»
15 years 3 months ago
A Dynamic Traffic Shaping Technique for a Scalable QoS in ATM Networks
: Traffic shaping function becomes imperative for the new broadband services that are being deployed in order to avoid information loss, to provide the end users multiple traffic o...
Francis Joseph Ogwu, Mohammad Talib, Ganiyu Aderou...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 7 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
112
Voted
ICASSP
2008
IEEE
15 years 9 months ago
Discriminative training by iterative linear programming optimization
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
Brian Mak, Benny Ng