308 search results - page 55 / 62 » Answer Set Programming Based on Propositional Satisfiability |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
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 ...
76
Voted
WIOPT
2006
IEEE
15 years 3 months ago
2006
IEEE
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...
103
click to vote
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
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)...
185
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
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...
93
Voted
WCE
2007
14 years 10 months ago
2007
—Multistage stochastic programs are effective for solving long-term planning problems under uncertainty. Such programs are usually based on scenario generation model about future...