Sciweavers

2968 search results - page 32 / 594
» Network Programming Using PLAN
Sort
View
CP
2004
Springer
14 years 1 months ago
Challenges for Constraint Programming in Networking
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
Helmut Simonis
AAAI
2007
13 years 10 months ago
An Experimental Comparison of Constraint Logic Programming and Answer Set Programming
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
COMPULOG
1999
Springer
13 years 12 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
CP
2004
Springer
14 years 1 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
ECIS
2001
13 years 9 months ago
Operationalising Guidelines for Inter-Organisational Systems Planning: Exploring a Learning Model
This paper addresses the issue of operationalising guidelines for IOS planning. The authors explore the usefulness of Triple Loop Learning in light of the IOS development experien...
Pat Finnegan, Robert D. Galliers, Philip Powell