Sciweavers

198 search results - page 11 / 40
» Evidence-invariant Sensitivity Bounds
Sort
View
AAAI
2006
15 years 7 days ago
Memory Intensive Branch-and-Bound Search for Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sens...
Radu Marinescu 0002, Rina Dechter
RTSS
2005
IEEE
15 years 4 months ago
Load Balancing in Bounded-Latency Content Distribution
In this paper we present a balanced data replication scheme that provides real-time latency bounds on content retrieval in content distribution networks. Many network applications...
Chengdu Huang, Gang Zhou, Tarek F. Abdelzaher, San...
TVLSI
1998
95views more  TVLSI 1998»
14 years 10 months ago
Bounds on pseudoexhaustive test lengths
Abstract—Pseudoexhaustive testing involves applying all possible input patterns to the individual output cones of a combinational circuit. Based on our new algebraic results, we ...
Rajagopalan Srinivasan, Sandeep K. Gupta, Melvin A...
CPAIOR
2006
Springer
15 years 2 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
FORTE
2001
15 years 6 days ago
A Family of Resource-Bound Real-Time Process Algebras
The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the ...
Insup Lee, Jin-Young Choi, Hee-Hwan Kwak, Anna Phi...