Sciweavers

3928 search results - page 100 / 786
» order 2006
Sort
View
IPPS
2006
IEEE
15 years 10 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
183
Voted
CP
2006
Springer
15 years 7 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
120
Voted
AMR
2006
Springer
131views Multimedia» more  AMR 2006»
15 years 6 months ago
Aspects of Adaptivity in P2P Information Retrieval
Abstract. Peer-to-Peer networks are comprised of multiple independently administered computers (peers) that cooperate via a common protocol in order to achieve a goal common to the...
Wolfgang Müller 0002, Andreas Henrich, Martin...
JCT
2010
158views more  JCT 2010»
15 years 2 months ago
An asymptotic solution to the cycle decomposition problem for complete graphs
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
Darryn E. Bryant, Daniel Horsley
AUTOMATICA
2006
86views more  AUTOMATICA 2006»
15 years 4 months ago
Averaging of nonsmooth systems using dither
It was shown by Zames and Shneydor and later by Mossaheb that a high-frequency dither signal of a quite arbitrary shape can be used to narrow the effective nonlinear sector of Lip...
Luigi Iannelli, Karl Henrik Johansson, Ulf T. J&ou...