Sciweavers

8496 search results - page 110 / 1700
» Problem Solving and Complex Systems
Sort
View
AIPS
2008
13 years 10 months ago
From One to Many: Planning for Loosely Coupled Multi-Agent Systems
Loosely coupled multi-agent systems are perceived as easier to plan for because they require less coordination between agent sub-plans. In this paper we set out to formalize this ...
Ronen I. Brafman, Carmel Domshlak
MOBIHOC
2009
ACM
14 years 19 days ago
A state-based battery model for nodes' lifetime estimation in wireless sensor networks
We address the problem of estimating the remaining energy of a node battery in wireless sensor networks. To solve this issue, we provide an on-line battery model that requires lim...
Joseph Rahmé, Khaldoun Al Agha

Book
494views
15 years 6 months ago
The Little Book of Semaphores
"I wrote the first edition this book with the goal of identifying synchronization idioms and patterns that could be understood in isolation and then assembled to solve compl...
Allen B. Downey
EOR
2008
72views more  EOR 2008»
13 years 8 months ago
The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
The ROADEF challenge is organized every two years by the French Society of Operations Research and Decision-Making Aid. The goal is to allow industrial partners to witness recent ...
Christine Solnon, Van Dat Cung, Alain Nguyen, Chri...
ANTS
2006
Springer
139views Algorithms» more  ANTS 2006»
13 years 11 months ago
Hard Instances of the Constrained Discrete Logarithm Problem
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent x belongs to a set known to the attacker. The complexity of generic algorithms f...
Ilya Mironov, Anton Mityagin, Kobbi Nissim