Sciweavers

1342 search results - page 225 / 269
» Ordered Programs as Abductive Systems
Sort
View
SIGSOFT
2007
ACM
14 years 9 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
WWW
2005
ACM
14 years 9 months ago
Improving text collection selection with coverage and overlap statistics
In an environment of distributed text collections, the first step in the information retrieval process is to identify which of all available collections are more relevant to a giv...
Thomas Hernandez, Subbarao Kambhampati
CC
2009
Springer
190views System Software» more  CC 2009»
14 years 9 months ago
SSA Elimination after Register Allocation
form uses a notational abstractions called -functions. These instructions have no analogous in actual machine instruction sets, and they must be replaced by ordinary instructions ...
Fernando Magno Quintão Pereira, Jens Palsbe...
WFLP
2009
Springer
277views Algorithms» more  WFLP 2009»
14 years 3 months ago
Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
Stephan Falke, Deepak Kapur
ATAL
2009
Springer
14 years 3 months ago
Adversarial search with procedural knowledge heuristic
We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game...
Viliam Lisý, Branislav Bosanský, Mic...