2314 search results - page 225 / 463 » Monoids over domains |
183
click to vote
IJCAI
1989
15 years 7 months ago
1989
Existing explanation facilities are typically far more appropriate for knowledge engineers engaged in system maintenance than for endusers of the system. This is because the expla...
176
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
171
click to vote
ECAI
2010
Springer
15 years 7 months ago
2010
Springer
It has been shown recently that deterministic conformant planning problems can be translated into classical problems that can be solved by off-the-shelf classical planners. In this...
153
click to vote
ARCS
2010
Springer
15 years 6 months ago
2010
Springer
Processor speed and available computing power constantly increases, enabling computation of more and more complex problems such as numerical simulations of physical processes. In t...
153
Voted
DSD
2010
IEEE
15 years 6 months ago
2010
IEEE
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...