Sciweavers

5084 search results - page 167 / 1017
» Proving Possibility Properties
Sort
View
TPHOL
2008
IEEE
16 years 22 days ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
CAV
2005
Springer
127views Hardware» more  CAV 2005»
15 years 12 months ago
Incremental and Complete Bounded Model Checking for Full PLTL
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...
Keijo Heljanko, Tommi A. Junttila, Timo Latvala
VTC
2007
IEEE
16 years 18 days ago
Toward Scalable, Automated Tower-Top Phased Array Calibration
Abstract— The tower-top deployment of base station electronics could prove of utility in future cellular communication applications. We present a scalable, non-radiative, automat...
Tim Cooper, Justine McCormack, Ronan Farrell, Gera...
ISAAC
2003
Springer
97views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Equilibria for Networks with Malicious Users
We consider the problem of characterizing user equilibria and optimal solutions for selfish routing in a given network. We extend the known models by considering malicious behavio...
George Karakostas, Anastasios Viglas
ALGORITHMICA
2010
72views more  ALGORITHMICA 2010»
15 years 6 months ago
Largest and Smallest Convex Hulls for Imprecise Points
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
Maarten Löffler, Marc J. van Kreveld