Sciweavers

1578 search results - page 123 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
157
Voted
AI
2007
Springer
15 years 9 months ago
Multiagent Constraint Satisfaction with Multiply Sectioned Constraint Networks
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
Yang Xiang, Wanling Zhang
127
Voted
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
16 years 16 days ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
143
Voted
COMSUR
2011
203views Hardware» more  COMSUR 2011»
14 years 3 months ago
Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious In
Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the netw...
Maxwell Young, Raouf Boutaba
124
Voted
ALGOSENSORS
2009
Springer
15 years 10 months ago
Link Reversal: How to Play Better to Work Less
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
Bernadette Charron-Bost, Jennifer L. Welch, Josef ...
134
Voted
CAIP
1997
Springer
125views Image Analysis» more  CAIP 1997»
15 years 7 months ago
An Algorithm for Intrinsic Dimensionality Estimation
Abstract. In this paper a new method for analyzing the intrinsic dimensionality (ID) of low dimensional manifolds in high dimensional feature spaces is presented. The basic idea is...
Jörg Bruske, Gerald Sommer