Sciweavers

12183 search results - page 454 / 2437
» Computers under Attacks!
Sort
View
PODC
1997
ACM
15 years 11 months ago
Computing Vector Functions on Anonymous Networks
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
Paolo Boldi, Sebastiano Vigna
CCA
2009
Springer
15 years 11 months ago
Effective Dispersion in Computable Metric Spaces
We investigate the relationship between computable metric spaces (X, d, ) and (X, d, ), where (X, d) is a given metric space. In the case of Euclidean space, and are equivalent u...
Zvonko Iljazovic
DAGSTUHL
2007
15 years 8 months ago
Homotopy Methods to Compute Equilibria in Game Theory
This paper presents a complete survey of the use of homotopy methods in game theory. Homotopies allow for a robust computation of game-theoretic equilibria and their refinements....
P. Jean-Jacques Herings, Ronald Peeters
SIGCSE
2008
ACM
144views Education» more  SIGCSE 2008»
15 years 6 months ago
Geographic information systems: real world applications for computer science
: This paper discusses the development and delivery of an upper level computer science elective course in geographic information systems (GIS). GIS applications span numerous and d...
Wendy Zhang, Theresa Beaubouef
WG
2010
Springer
15 years 5 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...