648 search results - page 117 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
148
Voted
ECOOP
2004
Springer
15 years 10 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...
145
click to vote
ACG
2009
Springer
15 years 11 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...
187
Voted
DASFAA
2010
IEEE
15 years 9 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...
135
Voted
COMPGEOM
2005
ACM
15 years 7 months 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...
150
click to vote
INFOVIS
1995
IEEE
15 years 8 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...