Sciweavers

4377 search results - page 860 / 876
» Mass problems and randomness
Sort
View
78
Voted
RAS
2006
123views more  RAS 2006»
14 years 9 months ago
Planning exploration strategies for simultaneous localization and mapping
In this paper, we present techniques that allow one or multiple mobile robots to efficiently explore and model their environment. While much existing research in the area of Simul...
Benjamín Tovar, Lourdes Muñoz-G&oacu...
AI
2005
Springer
14 years 9 months ago
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
Zhao Xing, Weixiong Zhang
TCAD
2008
136views more  TCAD 2008»
14 years 9 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
TCAD
2008
96views more  TCAD 2008»
14 years 9 months ago
An Implicit Approach to Minimizing Range-Equivalent Circuits
Abstract--Simplifying a combinational circuit while preserving its range has a variety of applications, such as combinational equivalence checking and random simulation. Previous a...
Yung-Chih Chen, Chun-Yao Wang
TCOM
2008
136views more  TCOM 2008»
14 years 9 months ago
Cross-layer adaptive transmission with incomplete system state information
We consider a point-to-point communication system in which data packets randomly arrive to a finite-length buffer and are subsequently transmitted to a receiver over a timevarying ...
Anh Tuan Hoang, Mehul Motani