Sciweavers

476 search results - page 26 / 96
» The Complexity of Equality Constraint Languages
Sort
View
CP
2004
Springer
14 years 1 months ago
Challenges for Constraint Programming in Networking
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
Helmut Simonis
ROBOCUP
1999
Springer
95views Robotics» more  ROBOCUP 1999»
13 years 12 months ago
Spatial Agents Implemented in a Logical Expressible Language
In this paper, we present a multi-layered architecture for spatial and temporal agents. The focus is laid on the declarativity of the approach, which makes agent scripts expressive...
Frieder Stolzenburg, Oliver Obst, Jan Murray, Bj&o...
GLOBECOM
2008
IEEE
14 years 2 months ago
Aerial Platform Placement Algorithm to Satisfy Connectivity and Capacity Constraints in Wireless Ad-Hoc Networks
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
Senni Perumal, John S. Baras
IJCAI
1997
13 years 9 months ago
On the Interaction of Metonymies and Anaphora
From the analysis of naturally occurring texts we obtained evidence for the systematic interaction between nominal anaphora and metonymies. This leads us to postulate an integrate...
Katja Markert, Udo Hahn
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 7 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen