729 search results - page 95 / 146 » Combinatorial Surface Integration |
CP
2000
Springer
14 years 25 days ago
2000
Springer
Combinatorial problems can be efficiently tackled with constraint programming systems. The main tasks of the development of a constraint-based application are modeling the proble...
FOCS
1997
IEEE
14 years 21 days ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
FM
2006
Springer
14 years 5 days ago
2006
Springer
Abstract. The key to the integration of formal methods into engineering practice is education. In teaching, domain-independent problems -i.e., not requiring prior engineering backg...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
AIPS
2006
13 years 10 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...