Sciweavers

419 search results - page 41 / 84
» An LP-Designed Algorithm for Constraint Satisfaction
Sort
View
WG
2004
Springer
14 years 1 months ago
Decremental Clique Problem
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
Fabrizio Grandoni, Giuseppe F. Italiano
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 8 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
14 years 2 months ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster
ECEASST
2008
95views more  ECEASST 2008»
13 years 8 months ago
A Static Layout Algorithm for DiaMeta
Abstract: The diagram editor generator framework DIAMETA utilizes meta-modelbased language specifications and supports free-hand as well as structured editing. In this paper we pre...
Sonja Maier, Mark Minas
GLOBECOM
2008
IEEE
14 years 3 months ago
Guaranteed Boxed Localization in MANETs by Interval Analysis and Constraints Propagation Techniques
Abstract—In this contribution, we propose an original algorithm for self-localization in mobile ad-hoc networks. The proposed technique, based on interval analysis, is suited to ...
Farah Mourad, Hichem Snoussi, Fahed Abdallah, C&ea...