Sciweavers

1968 search results - page 345 / 394
» The Complexity of Valued Constraint Models
Sort
View
EUROPAR
2006
Springer
14 years 4 days ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
14 years 4 days ago
3D airspace sectoring by evolutionary computation: real-world applications
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
Daniel Delahaye, Stephane Puechmorel
ICSE
2000
IEEE-ACM
14 years 2 days ago
Requirements engineering in the year 00: a research perspective
Requirements engineering (RE) is concerned with the identification of the goals to be achieved by the envisioned system, the operationalization of such goals into services and con...
Axel van Lamsweerde
AAAI
2007
13 years 10 months ago
Answering Regular Path Queries in Expressive Description Logics: An Automata-Theoretic Approach
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
Diego Calvanese, Thomas Eiter, Magdalena Ortiz
DLOG
2007
13 years 10 months ago
Action Based ABox Update: an Example from the Chemical Compound Formulation
Abstract. The Chemical Formulation Problem (Compounding Problem) consists in modifying the chemical formulation of a compound in order to obtain a new compound showing a set of des...
Alessandro Mosca, Matteo Palmonari