4303 search results - page 5 / 861 » Are We There Yet |
SAGA
2001
Springer
13 years 11 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We present a robust representation for gait recognition that is compact, easy to construct, and affords efficient matching. Instead of a time series based representation comprisin...
EDBT
2009
ACM
13 years 12 months ago
2009
ACM
Constraints are important for a variety of XML recommendations and applications. Consequently, there are numerous opportunities for advancing the treatment of XML semantics. In pa...
ESAS
2006
Springer
13 years 11 months ago
2006
Springer
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
CSL
2004
Springer
14 years 23 days ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...