Sciweavers

2109 search results - page 388 / 422
» Solving Necklace Constraint Problems
Sort
View
ICWS
2003
IEEE
14 years 10 days ago
Application of Linear Logic to Web Service Composition
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
Jinghai Rao, Peep Küngas, Mihhail Matskin
SBACPAD
2004
IEEE
83views Hardware» more  SBACPAD 2004»
14 years 10 days ago
Parallel Adaptive Mesh Coarsening for Seismic Tomography
Seismic tomography enables to model the internal structure of the Earth. In order to improve the precision of existing models, a huge amount of acquired seismic data must be analy...
Marc Grunberg, Stéphane Genaud, Catherine M...
IJCAI
2003
14 years 10 days ago
On a generalization of triangulated graphs for domains decomposition of CSPs
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
Assef Chmeiss, Philippe Jégou, Lamia Keddar
IJCAI
2003
14 years 10 days ago
Approximating Optimal Policies for Agents with Limited Execution Resources
An agent with limited consumable execution resources needs policies that attempt to achieve good performance while respecting these limitations. Otherwise, an agent (such as a pla...
Dmitri A. Dolgov, Edmund H. Durfee
COR
2008
99views more  COR 2008»
13 years 11 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi