Sciweavers

8496 search results - page 11 / 1700
» Problem Solving and Complex Systems
Sort
View
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
CORR
2011
Springer
186views Education» more  CORR 2011»
13 years 2 months ago
On the Complexity of Solving a Bivariate Polynomial System
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
Pavel Emeliyanenko, Michael Sagraloff
MOR
2002
94views more  MOR 2002»
13 years 7 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel
ISSAC
2007
Springer
111views Mathematics» more  ISSAC 2007»
14 years 1 months ago
On the complexity of real solving bivariate systems
Dimitrios I. Diochnos, Ioannis Z. Emiris, Elias P....
UM
2005
Springer
14 years 1 months ago
Modeling Individual and Collaborative Problem Solving in Medical Problem-Based Learning
Abstract. Since problem solving in group problem-based learning is a collaborative process, modeling individuals and the group is necessary if we wish to develop an intelligent tut...
Siriwan Suebnukarn, Peter Haddawy