Sciweavers

325 search results - page 64 / 65
» Extending an Algebraic Modeling Language to Support Constrai...
Sort
View
ICALP
2009
Springer
14 years 7 months ago
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
Yossi Azar, Aleksander Madry, Thomas Moscibroda, D...
COLING
1996
13 years 8 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
DAGSTUHL
2007
13 years 8 months ago
Interdisciplinary Design Research for End-User Software Engineering
rocesses involve modeling – simplifying or abstracting some aspects of the problem domain in order to plan and evaluate design decisions. The use of representations to reason abo...
Alan F. Blackwell
PVLDB
2008
182views more  PVLDB 2008»
13 years 6 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
CASES
2004
ACM
14 years 10 days ago
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...