Sciweavers

536 search results - page 42 / 108
» AI techniques in modelling, assignment, problem solving and ...
Sort
View
PG
2003
IEEE
14 years 3 months ago
Bounding Recursive Procedural Models Using Convex Optimization
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
Orion Sky Lawlor, John C. Hart
AAI
2005
117views more  AAI 2005»
13 years 9 months ago
Machine Learning in Hybrid Hierarchical and Partial-Order Planners for Manufacturing Domains
The application of AI planning techniques to manufacturing systems is being widely deployed for all the tasks involved in the process, from product design to production planning an...
Susana Fernández, Ricardo Aler, Daniel Borr...
WLP
2004
Springer
14 years 3 months ago
Effective Modeling with Constraints
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
Roman Barták
ATMOS
2008
103views Optimization» more  ATMOS 2008»
13 years 11 months ago
IP-based Techniques for Delay Management with Priority Decisions
Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the...
Michael Schachtebeck, Anita Schöbel
BMCBI
2010
116views more  BMCBI 2010»
13 years 10 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel