Sciweavers

1022 search results - page 83 / 205
» Logspace Complexity of Functions and Structures
Sort
View
DAC
2005
ACM
15 years 11 months ago
Simulation based deadlock analysis for system level designs
In the design of highly complex, heterogeneous, and concurrent systems, deadlock detection and resolution remains an important issue. In this paper, we systematically analyze the ...
Xi Chen, Abhijit Davare, Harry Hsieh, Alberto L. S...
ATAL
2006
Springer
15 years 1 months ago
Tractable negotiation in tree-structured domains
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
Yann Chevaleyre, Ulle Endriss, Nicolas Maudet
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 5 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
DAC
2003
ACM
15 years 11 months ago
A new enhanced constructive decomposition and mapping algorithm
Structuring and mapping of a Boolean function is an important problem in the design of complex integrated circuits. Libraryaware constructive decomposition offers a solution to th...
Alan Mishchenko, Xinning Wang, Timothy Kam
ACISICIS
2008
IEEE
15 years 4 months ago
Developing Accessible Applications with User-Centered Architecture
Design of accessible applications is often a challenge for software architects and developers. Development usually starts with structure and functionality of the planned applicati...
Sabina Jeschke, Helmut Vieritz, Olivier Pfeiffer