Sciweavers

1480 search results - page 125 / 296
» Ants can solve constraint satisfaction problems
Sort
View
ENTCS
2008
85views more  ENTCS 2008»
15 years 6 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
PERCOM
2006
ACM
16 years 6 months ago
Maximum Weighted Matching with Interference Constraints
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...
Gaurav Sharma, Ness B. Shroff, Ravi R. Mazumdar
AAAI
1996
15 years 7 months ago
Qualitative Multiple-Fault Diagnosis of Continuous Dynamic Systems Using Behavioral Modes
Most model-based diagnosis systems, such as GDE and Sherlock, have concerned discrete, static systems such as logic circuits and use simple constraint propagation to detect incons...
Siddarth Subramanian, Raymond J. Mooney
ECAI
2000
Springer
15 years 10 months ago
Activity Recognition from Video Sequences using Declarative Models
Abstract. We propose here a new approach for video sequence interpretation based on declarative models of activities. The aim of the video sequence interpretation is to recognize i...
Nathanaël Rota, Monique Thonnat
SAS
2007
Springer
16 years 17 days ago
Refactoring Using Type Constraints
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
Frank Tip