Sciweavers

4926 search results - page 105 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
SMA
2009
ACM
219views Solid Modeling» more  SMA 2009»
15 years 9 months ago
Log-aesthetic space curve segments
For designing aesthetic surfaces, such as the car bodies, it is very important to use aesthetic curves as characteristic lines. In such curves, the curvature should be monotonical...
Norimasa Yoshida, Ryo Fukuda, Takafumi Saito
133
Voted
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 4 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
WG
2000
Springer
15 years 6 months ago
Networks with Small Stretch Number
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
Serafino Cicerone, Gabriele Di Stefano
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
15 years 2 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
122
Voted
SAC
2008
ACM
15 years 1 months ago
PHALANX: a graph-theoretic framework for test case prioritization
Test case prioritization for regression testing can be performed using different metrics (e.g., statement coverage, path coverage) depending on the application context. Employing ...
Murali Krishna Ramanathan, Mehmet Koyutürk, A...