Sciweavers

2168 search results - page 434 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
IWMM
2010
Springer
140views Hardware» more  IWMM 2010»
13 years 7 months ago
Parametric inference of memory requirements for garbage collected languages
The accurate prediction of program's memory requirements is a critical component in software development. Existing heap space analyses either do not take deallocation into ac...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ATAL
2010
Springer
13 years 6 months ago
On the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
SMA
2008
ACM
172views Solid Modeling» more  SMA 2008»
13 years 5 months ago
Guarding curvilinear art galleries with edge or mobile guards
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
Menelaos I. Karavelas