Sciweavers

13376 search results - page 49 / 2676
» Problem Solving with
Sort
View
PRICAI
2004
Springer
15 years 11 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
CDC
2008
IEEE
150views Control Systems» more  CDC 2008»
16 years 29 days ago
Subgradient methods and consensus algorithms for solving convex optimization problems
— In this paper we propose a subgradient method for solving coupled optimization problems in a distributed way given restrictions on the communication topology. The iterative pro...
Björn Johansson, Tamás Keviczky, Mikae...
PARA
2004
Springer
15 years 11 months ago
A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...
Abbas Edalat, Dirk Pattinson
EVOW
2008
Springer
15 years 8 months ago
A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
Bart G. W. Craenen, Ben Paechter
BPSC
2009
240views Business» more  BPSC 2009»
15 years 7 months ago
Modelling and Solving Configuration Problems on Business Processes Using a Multi-Level Constraint Satisfaction Approach
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
Wolfgang Runte