11740 search results - page 161 / 2348 » More Problems in Rewriting |
164
click to vote
SAT
2010
Springer
15 years 2 months ago
2010
Springer
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
165
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
138
click to vote
MSWIM
2009
ACM
15 years 11 months ago
2009
ACM
In recent years, the number of sensor network deployments for real-life applications has rapidly increased and it is expected to expand even more in the near future. Actually, for...
119
Voted
SIAMSC
2008
15 years 4 months ago
2008
We present a compact discontinuous Galerkin (CDG) method for an elliptic model problem. The problem is first cast as a system of first order equations by introducing the gradient o...
133
Voted
CPM
2000
Springer
15 years 7 months ago
2000
Springer
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...