Sciweavers

380 search results - page 57 / 76
» Cluster Graphs as Abstractions for Constraint Satisfaction P...
Sort
View
CP
2003
Springer
14 years 1 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
VL
2009
IEEE
187views Visual Languages» more  VL 2009»
14 years 3 months ago
Changing euler diagram properties by edge transformation of euler dual graphs
Euler diagrams form the basis of several visual modelling notations, including statecharts and constraint diagrams. Recently, various techniques for automated Euler diagram drawin...
John Howse, Peter Rodgers, Gem Stapleton
NETWORKS
2010
13 years 7 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
IJWMC
2010
115views more  IJWMC 2010»
13 years 5 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
IFIP12
2009
13 years 6 months ago
Defining a Task's Temporal Domain for Intelligent Calendar Applications
Abstract Intelligent calendar assistants have many years ago attracted researchers from the areas of scheduling, machine learning and human computer interaction. However, all effor...
Anastasios Alexiadis, Ioannis Refanidis