Sciweavers

271 search results - page 15 / 55
» Graph limits and parameter testing
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
CHI
2010
ACM
14 years 3 months ago
FrameWire: a tool for automatically extracting interaction logic from paper prototyping tests
Paper prototyping offers unique affordances for interface design. However, due to its spontaneous nature and the limitations of paper, it is difficult to distill and communicate a...
Yang Li, Xiang Cao, Katherine Everitt, Morgan Dixo...
JPDC
2008
129views more  JPDC 2008»
13 years 9 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
CG
2010
Springer
13 years 8 months ago
Monte-Carlo Simulation Balancing in Practice
Simulation balancing is a new technique to tune parameters of a playout policy for a Monte-Carlo game-playing program. So far, this algorithm had only been tested in a very artific...
Shih-Chieh Huang, Rémi Coulom, Shun-Shii Li...
RTCSA
1999
IEEE
14 years 2 months ago
A Symbolic Model Checker for Testing ASTRAL Real-Time Specifications
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
Zhe Dang, Richard A. Kemmerer