Sciweavers

18 search results - page 3 / 4
» Random Generation and Enumeration of Proper Interval Graphs
Sort
View
ATAL
2011
Springer
12 years 6 months ago
A double oracle algorithm for zero-sum security games on graphs
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
Manish Jain, Dmytro Korzhyk, Ondrej Vanek, Vincent...
TROB
2002
138views more  TROB 2002»
13 years 5 months ago
Interference-free polyhedral configurations for stacking
This paper uses a configuration space ( -space) based method to compute interference-free configuration for stacking polyhedral sheet metal parts. This work forms the interference ...
Venkateswara R. Ayyadevara, David A. Bourne, Kenji...
PVLDB
2008
126views more  PVLDB 2008»
13 years 5 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
HICSS
2002
IEEE
212views Biometrics» more  HICSS 2002»
13 years 11 months ago
Connectivity-Based k-Hop Clustering in Wireless Networks
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...
Geng Chen, Fabian Garcia Nocetti, Julio Solano-Gon...
JSAT
2008
122views more  JSAT 2008»
13 years 6 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
Sriyankar Acharyya