Sciweavers

352 search results - page 21 / 71
» On the optimal reachability problem of weighted timed automa...
Sort
View
GRC
2008
IEEE
13 years 8 months ago
Convergence of Ant Colony Optimization on First-order Deceptive Systems
Deceptive problems have been considered difficult for ant colony optimization (ACO) and it was believed that ACO will fail to converge to global optima of deceptive problems. Thi...
Yixin Chen, Haiying Sun
IJFCS
2006
110views more  IJFCS 2006»
13 years 7 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 7 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 2 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
JCO
2010
182views more  JCO 2010»
13 years 6 months ago
Polynomial time approximation schemes for minimum disk cover problems
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
Chen Liao, Shiyan Hu