Sciweavers

2231 search results - page 213 / 447
» Alternation as a programming paradigm
Sort
View
SEFM
2005
IEEE
16 years 6 days ago
Description Logics for Shape Analysis
Verification of programs requires reasoning about sets of program states. In case of programs manipulating pointers, program states are pointer graphs. Verification of such prog...
Lilia Georgieva, Patrick Maier
VLDB
2005
ACM
134views Database» more  VLDB 2005»
16 years 3 days ago
MDL Summarization with Holes
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
Shaofeng Bu, Laks V. S. Lakshmanan, Raymond T. Ng
HIPS
1998
IEEE
15 years 11 months ago
ZPL's WYSIWYG Performance Model
ZPL is a parallel array language designed for high performance scientific and engineering computations. Unlike other parallel languages, ZPL is founded on a machine he CTA) that a...
Bradford L. Chamberlain, Sung-Eun Choi, E. Christo...
POPL
2010
ACM
15 years 9 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...
MP
2006
119views more  MP 2006»
15 years 6 months ago
Approximate extended formulations
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
Mathieu Van Vyve, Laurence A. Wolsey