6047 search results - page 241 / 1210 » Modeling with Extend |
154
click to vote
FORMATS
2006
Springer
15 years 7 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
125
click to vote
CASCON
2006
15 years 5 months ago
2006
Automatically determining the situation of an ad-hoc group of people and devices within a smart environment is a significant challenge in pervasive computing systems. Current appro...
143
click to vote
AAAI
1997
15 years 5 months ago
1997
CNF-BCP is a well-known propositional reasoner that extends clausal Boolean Constraint Propagation (BCP) to non-clausal theories. Although BCP has efficient linear-time implementa...
144
click to vote
IJCAI
1993
15 years 5 months ago
1993
Anytime algorithms, whose quality of results improves gradually as computation time increases, provide useful performance components for timecritical planning and control of robot...
125
Voted
BILDMED
2009
15 years 5 months ago
2009
Abstract. The discrimination of benign and malignant types of mammographic masses is a major challenge for radiologists. The classic eigenfaces method was recently adapted for the ...