Sciweavers

16430 search results - page 3105 / 3286
» On Computable Tree Functions
Sort
View
PODC
2010
ACM
14 years 10 hour ago
Adaptive randomized mutual exclusion in sub-logarithmic expected time
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Danny Hendler, Philipp Woelfel
PODC
2010
ACM
14 years 10 hour ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
14 years 9 hour ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
EXPCS
2007
14 years 9 hour ago
Rapid file system development using ptrace
Developing kernel-level file systems is a difficult task that requires a significant time investment. For experimental file systems, it is desirable to develop a prototype before ...
Richard P. Spillane, Charles P. Wright, Gopalan Si...
SP
2010
IEEE
217views Security Privacy» more  SP 2010»
14 years 7 hour ago
Experimental Security Analysis of a Modern Automobile
Abstract—Modern automobiles are no longer mere mechanical devices; they are pervasively monitored and controlled by dozens of digital computers coordinated via internal vehicular...
Karl Koscher, Alexei Czeskis, Franziska Roesner, S...
« Prev « First page 3105 / 3286 Last » Next »