1029 search results - page 204 / 206 » Neural Networks and Complexity Theory |
IADIS
2004
13 years 8 months ago
2004
In the preparation of technology transition, the contextual and alternative definitions of the usability heuristics of multifaceted role of the best practice methodology of Teleco...
UAI
1997
13 years 8 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
SOSP
2005
ACM
14 years 4 months ago
2005
ACM
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
SPAA
2009
ACM
14 years 1 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...