Sciweavers

13 search results - page 1 / 3
» Extending uncertainty formalisms to linear constraints and o...
Sort
View
IJAR
2008
108views more  IJAR 2008»
13 years 4 months ago
Extending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
Nic Wilson
ISSTA
2000
ACM
13 years 9 months ago
Verisim: Formal analysis of network simulations
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim...
LACL
2005
Springer
13 years 10 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis
SAS
2001
Springer
13 years 9 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
ATAL
2007
Springer
13 years 8 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...