Sciweavers

308 search results - page 55 / 62
» Answer Set Programming Based on Propositional Satisfiability
Sort
View
ICALP
2010
Springer
14 years 12 days ago
Preprocessing of Min Ones Problems: A Dichotomy
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
Stefan Kratsch, Magnus Wahlström
WIOPT
2006
IEEE
14 years 1 months ago
Connection-level QoS provisioning in multiple transmission technology-based OFDM system
A state-of-the-art orthogonal frequency division multiplexing (OFDM)-based access system, such as the DiffSeg system [1][2], uses a different set of transmission technologies, e.g...
Youngkyu Choi, Sunghyun Choi, Sung-Pil Hong
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
13 years 11 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
ICFP
2009
ACM
14 years 8 months ago
Identifying query incompatibilities with evolving XML schemas
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validi...
Nabil Layaïda, Pierre Genevès, Vincent...
WCE
2007
13 years 8 months ago
Scenario Generation Employing Copulas
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...
Kristina Sutiene, Henrikas Pranevicius