Sciweavers

2398 search results - page 117 / 480
» Constraint Programming and Graph Algorithms
Sort
View
DIALM
2007
ACM
110views Algorithms» more  DIALM 2007»
15 years 9 months ago
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks
We consider the following channel assignment problem in multiradio multi-channel wireless networks: Given a wireless network where k orthogonal channels are available and each nod...
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, ...
CPAIOR
2006
Springer
15 years 8 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
MFCS
2009
Springer
15 years 11 months ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
119
Voted
AAAI
2006
15 years 6 months ago
Identifying and Generating Easy Sets of Constraints for Clustering
Clustering under constraints is a recent innovation in the artificial intelligence community that has yielded significant practical benefit. However, recent work has shown that fo...
Ian Davidson, S. S. Ravi
TACAS
2009
Springer
127views Algorithms» more  TACAS 2009»
15 years 11 months ago
From Tests to Proofs
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been exte...
Ashutosh Gupta, Rupak Majumdar, Andrey Rybalchenko