Sciweavers

197 search results - page 13 / 40
» Advances in Local Search for Satisfiability
Sort
View
ECAI
2004
Springer
13 years 11 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
OOPSLA
2010
Springer
13 years 5 months ago
Encapsulation and locality: a foundation for concurrency support in multi-language virtual machines?
We propose to search for common abstractions for different concurrency models to enable high-level language virtual machines to support a wide range of different concurrency model...
Stefan Marr
PPAM
2007
Springer
14 years 1 months ago
Alea - Grid Scheduling Simulation Environment
This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able...
Dalibor Klusácek, Ludek Matyska, Hana Rudov...
DAGSTUHL
2007
13 years 9 months ago
Exploiting Community Behavior for Enhanced Link Analysis and Web Search
Methods for Web link analysis and authority ranking such as PageRank are based on the assumption that a user endorses a Web page when creating a hyperlink to this page. There is a...
Julia Luxenburger, Gerhard Weikum
CAD
1998
Springer
13 years 7 months ago
Knot-removal surface fairing using search strategies
Abstract. This paper presents two automatic fairing algorithms for parametric C2 -continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot rein...
Stefanie Hahmann, Stefan Konz