Sciweavers

13987 search results - page 548 / 2798
» The Two Guards Problem
Sort
View
CN
1998
95views more  CN 1998»
15 years 6 months ago
The Limits of Web Metadata, and Beyond
The World Wide Web currently has a huge amount of data, with practically no classification information, and this makes it extremely difficult to handle effectively. It has been re...
Massimo Marchiori
MJ
2007
87views more  MJ 2007»
15 years 6 months ago
Using SAT-based techniques in power estimation
Recent algorithmic advances in Boolean satisfiability (SAT), along with highly efficient solver implementations, have enabled the successful deployment of SAT technology in a wi...
Assim Sagahyroon, Fadi A. Aloul
ICRA
2010
IEEE
121views Robotics» more  ICRA 2010»
15 years 5 months ago
On the global optimum of planar, range-based robot-to-robot relative pose estimation
Abstract— In this paper, we address the problem of determining the relative position and orientation (pose) of two robots navigating in 2D, based on known egomotion and noisy rob...
Nikolas Trawny, Stergios I. Roumeliotis
JITECH
2010
116views more  JITECH 2010»
15 years 5 months ago
Design theory for dynamic complexity in information infrastructures: the case of building internet
We propose a design theory that tackles dynamic complexity in the design for Information Infrastructures (IIs) defined as a shared, open, heterogeneous and evolving socio-technica...
Ole Hanseth, Kalle Lyytinen
AAAI
2010
15 years 5 months ago
Latent Class Models for Algorithm Portfolio Methods
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
Bryan Silverthorn, Risto Miikkulainen