Sciweavers

4117 search results - page 556 / 824
» On the Satisfiability of Complex Constraints
Sort
View
DEBS
2008
ACM
15 years 7 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
203
Voted
FAABS
2000
Springer
15 years 10 months ago
Design and Mathematical Analysis of Agent-Based Systems
Abstract. Agent-based systems that are composed of simple locally interacting agents but which demonstrate complex group behavior o er several advantages over traditional multi-age...
Kristina Lerman
JFP
2000
91views more  JFP 2000»
15 years 6 months ago
Uniform confluence in concurrent computation
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the suc...
Joachim Niehren
CADE
2005
Springer
16 years 7 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
IROS
2008
IEEE
104views Robotics» more  IROS 2008»
16 years 1 months ago
Generalizing metamodules to simplify planning in modular robotic systems
— In this paper we develop a theory of metamodules and an associated distributed asynchronous planner which generalizes previous work on metamodules for lattice-based modular rob...
Daniel J. Dewey, Michael P. Ashley-Rollman, Michae...