Sciweavers

1205 search results - page 24 / 241
» Program Extraction from Large Proof Developments
Sort
View
AAAI
2000
14 years 8 days ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
COMPSAC
1998
IEEE
14 years 3 months ago
A Fresh Look at Programming-in-the-Large
Realizing a shift of software engineering towards a component-based approach to software development requires the development of higher level programming systems supporting the de...
Walter Cazzola, Andrea Savigni, Andrea Sosio, Fran...
SIGIR
1993
ACM
14 years 3 months ago
Development of a Modern OPAC: From REVTOLC to MARIAN
Since 1986 we have investigated the problems and possibilities of applying modern information retrieval methods to large online public access library catalogs (OPACs). In the Retr...
Edward A. Fox, Robert K. France, Eskinder Sahle, A...
PLDI
2012
ACM
12 years 1 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
COLING
2010
13 years 6 months ago
Opinion Summarization with Integer Linear Programming Formulation for Sentence Extraction and Ordering
In this paper we propose a novel algorithm for opinion summarization that takes account of content and coherence, simultaneously. We consider a summary as a sequence of sentences ...
Hitoshi Nishikawa, Takaaki Hasegawa, Yoshihiro Mat...