648 search results - page 117 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
ECOOP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Software systems obey the 80/20 rule: aggressively optimizing a vital few execution paths yields large speedups. However, finding the vital few paths can be difficult, e...
ACG
2009
Springer
15 years 5 months ago
2009
Springer
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
127
click to vote
DASFAA
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
COMPGEOM
2005
ACM
15 years 15 days ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
INFOVIS
1995
IEEE
15 years 2 months ago
1995
IEEE
Visualizations which depict entire information spaces provide context for navigation and browsing tasks; however, the limited size of the display screen makes creating effective g...