Sciweavers

3172 search results - page 335 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
TSMC
1998
82views more  TSMC 1998»
15 years 6 months ago
To push or not to push: on the rearrangement of movable objects by a mobile robot
—We formulate and address the problem of planning a pushing manipulation by a mobile robot which tries to rearrange several movable objects in its work space. We present an algor...
Ohad Ben-Shahar, Ehud Rivlin
TEC
2002
183views more  TEC 2002»
15 years 6 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
TOG
2002
141views more  TOG 2002»
15 years 6 months ago
Geometry images
Surface geometry is often modeled with irregular triangle meshes. The process of remeshing refers to approximating such geometry using a mesh with (semi)-regular connectivity, whi...
Xianfeng Gu, Steven J. Gortler, Hugues Hoppe
COR
2008
131views more  COR 2008»
15 years 6 months ago
Comparing methods for multiattribute decision making with ordinal weights
This paper is concerned with procedures for ranking discrete alternatives when their values are evaluated precisely on multiple attributes and the attribute weights are known only...
Byeong Seok Ahn, Kyung Sam Park
CORR
2008
Springer
131views Education» more  CORR 2008»
15 years 6 months ago
Towards a More Accurate Carrier Sensing Model for CSMA Wireless Networks
Abstract--In the majority of studies on CSMA wireless networks, a contention graph is used to model the carrier sensing relationships among links. This is a 0-1 model in which two ...
Caihong Kai, Soung Chang Liew