6266 search results - page 38 / 1254 » New results on the computability and complexity of points - ... |
FOSAD
2009
Springer
14 years 3 months ago
2009
Springer
We introduce the Open-source Fixed-point Model Checker OFMC for symbolic security protocol analysis, which extends the Onthe-fly Model Checker (the previous OFMC). The native inpu...
TCS
2010
13 years 7 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
ICDAR
2007
IEEE
14 years 3 months ago
2007
IEEE
As pen-based computing becomes more prevalent, it is increasingly important to be able to share ink across applications and across platforms. The emerging standard Ink Markup Lang...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
WSC
1997
13 years 10 months ago
1997
This paper deals with ranking and selection problem via simulation. We present an optimal computing budget allocation technique which can select the best of k simulated designs. T...