Sciweavers

33 search results - page 3 / 7
» Unbiased Branches: An Open Problem
Sort
View
QEST
2007
IEEE
13 years 11 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
13 years 6 months ago
Fitness calculation approach for the switch-case construct in evolutionary testing
A well-designed fitness function is essential to the effectiveness and efficiency of evolutionary testing. Fitness function design has been researched extensively. For fitness ...
Yan Wang, Zhiwen Bai, Miao Zhang, Wen Du, Ying Qin...
SSD
2005
Springer
98views Database» more  SSD 2005»
13 years 10 months ago
Medoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the ...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
CGI
2003
IEEE
13 years 10 months ago
Modeling lobed leaves
In contrast to the extensively researched modeling of plant architecture, the modeling of plant organs largely remains an open problem. In this paper, we propose a method for mode...
Lars Mündermann, Peter MacMurchy, Juraj Pivov...
EUROSYS
2011
ACM
12 years 8 months ago
Striking a new balance between program instrumentation and debugging time
Although they are helpful in many cases, state-of-the-art bug reporting systems may impose excessive overhead on users, leak private information, or provide little help to the dev...
Olivier Crameri, Ricardo Bianchini, Willy Zwaenepo...