3265 search results - page 449 / 653 » Representing Groups on Graphs |
218
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
189
click to vote
CG
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Over the years, various research projects have attempted to develop a chess program that learns to play well given little prior knowledge beyond the rules of the game. Ea...
188
click to vote
EXPCS
2007
15 years 8 months ago
2007
Pipeline Spectroscopy is a new technique that allows us to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precis...
169
click to vote
IJCAI
2003
15 years 8 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
162
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...