Sciweavers

1650 search results - page 282 / 330
» The HOM problem is decidable
Sort
View
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 1 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
TACAS
2007
Springer
165views Algorithms» more  TACAS 2007»
14 years 1 months ago
Multi-objective Model Checking of Markov Decision Processes
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Va...
SPAA
2006
ACM
14 years 1 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
RTAS
2005
IEEE
14 years 1 months ago
Convoy Driving through Ad-Hoc Coalition Formation
— Convoy driving on public highways is a useful phenomena which increases the safety and the throughput of the highway. We present an approach through which a wireless Convoy Dri...
Majid Ali Khan, Ladislau Bölöni
PASTE
2004
ACM
14 years 1 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick