3991 search results - page 127 / 799 » Bounding homogeneous models |
SIAMCOMP
2000
13 years 7 months ago
2000
This paper presents a lower bound of (D + n/ log n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of ...
TCS
2010
13 years 2 months ago
2010
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), ...
ICRA
2002
IEEE
14 years 1 months ago
2002
IEEE
Previous work [3, 6, 9, 8, 7, 1] has presented the time optimal trajectories for three classes of non-holonomic mobile robots: steered cars that can only go forwards, steered cars...
WDAG
2001
Springer
14 years 14 days ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...