Sciweavers

1096 search results - page 154 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
IPPS
2007
IEEE
15 years 6 months ago
Using Linearization for Global Consistency in SSR
Novel routing algorithms such as scalable source routing (SSR) and virtual ring routing (VRR) need to set up and maintain a virtual ring structure among all the nodes in the netwo...
Kendy Kutzner, Thomas Fuhrmann
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 1 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
GRAPHICSINTERFACE
2003
15 years 1 months ago
Easy Realignment of k-DOP Bounding Volumes
In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is eq...
Christoph Fünfzig, Dieter W. Fellner
ICASSP
2010
IEEE
14 years 10 months ago
Identification of linear systems in canonical form through an EM framework
Least-squares estimation has always been the main approach when applying prediction error methods (PEM) in the identification of linear dynamical systems. Regardless of the estim...
Pavlos Papadopoulos, Vassilis Digalakis
ATAL
2009
Springer
15 years 6 months ago
Analyzing the tradeoffs between breakup and cloning in the context of organizational self-design
Organizational Self-Design (OSD) has been proposed as an approach to constructing suitable organizations at runtime in which the agents are responsible for constructing their own ...
Sachin Kamboj