Sciweavers

656 search results - page 101 / 132
» A Formalization of Transition P Systems
Sort
View
IPPS
2006
IEEE
15 years 6 months ago
D1HT: a distributed one hop hash table
Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in o...
Luiz Rodolpho Monnerat, Cláudio L. Amorim
91
Voted
AI
2004
Springer
15 years 8 days ago
On the computational complexity of qualitative coalitional games
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
Michael Wooldridge, Paul E. Dunne
90
Voted
DATE
2007
IEEE
55views Hardware» more  DATE 2007»
15 years 6 months ago
Sensitivity analysis for fault-analysis and tolerance in RF front-end circuitry
RFIC reliability is fast becoming a major bottleneck in the yield and performance of modern IC systems, as process complexity and levels of integration continually increase. Due t...
Tejasvi Das, P. R. Mukund
WORDS
2003
IEEE
15 years 5 months ago
Input-Dependency Analysis for Hard Real-Time Software
The execution time of software for hard real-time systems must be predictable. Further, safe and not overly pessimistic bounds for the worst-case execution time (WCET) must be com...
Jan Gustafsson, Björn Lisper, Raimund Kirner,...
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 3 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow