Sciweavers

1816 search results - page 151 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
IJCAI
2003
15 years 7 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
TIME
2002
IEEE
15 years 11 months ago
Applying Local Search to Temporal Reasoning
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
John Thornton, Matthew Beaumont, Abdul Sattar, Mic...
PG
1999
IEEE
15 years 10 months ago
Reconstruction and Simplification of Surfaces from Contours
In this paper we consider the problem of reconstructing triangular surfaces from given contours. An algorithm solving this problem has to decide which contours of two successive s...
Reinhard Klein, Andreas Schilling, Wolfgang Stra&s...
RC
2002
96views more  RC 2002»
15 years 6 months ago
Verification of Invertibility of Complicated Functions over Large Domains
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
Jens Hoefkens, Martin Berz
CDC
2009
IEEE
101views Control Systems» more  CDC 2009»
15 years 11 months ago
Barrier function nonlinear optimization for optimal Decompression of divers
— This paper is based on a comprehensive dynamic mathematical model (Copernicus) of vascular bubble formation and growth during and after decompression from a dive. The model des...
Le Feng, Christian R. Gutvik, Tor Arne Johansen, D...