Sciweavers

56 search results - page 8 / 12
» Efficient Reasoning with Range and Domain Constraints
Sort
View
NIPS
2008
13 years 9 months ago
Multi-Agent Filtering with Infinitely Nested Beliefs
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
Luke S. Zettlemoyer, Brian Milch, Leslie Pack Kael...
SIGSOFT
2007
ACM
14 years 8 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
SIAMSC
2008
113views more  SIAMSC 2008»
13 years 7 months ago
An Efficient and Robust Method for Simulating Two-Phase Gel Dynamics
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...
Grady B. Wright, Robert D. Guy, Aaron L. Fogelson
ATAL
2005
Springer
14 years 1 months ago
Bumping strategies for the multiagent agreement problem
We introduce the Multiagent Agreement Problem (MAP) to represent a class of multiagent scheduling problems. MAP is based on the Distributed Constraint Reasoning (DCR) paradigm and...
Pragnesh Jay Modi, Manuela M. Veloso
VAMOS
2010
Springer
13 years 9 months ago
Supporting Stepwise, Incremental Product Derivation in Product Line Requirements Engineering
Deriving products from a software product line is difficult, particularly when there are many constraints in the variability of the product line. Understanding the impact of variab...
Reinhard Stoiber, Martin Glinz