Sciweavers

2348 search results - page 391 / 470
» A Kernel Approach to Comparing Distributions
Sort
View
SWARM
2008
SPRINGER
222views Optimization» more  SWARM 2008»
14 years 11 months ago
Biologically inspired redistribution of a swarm of robots among multiple sites
We present a biologically inspired approach to the dynamic assignment and reassignment of a homogeneous swarm of robots to multiple locations, which is relevant to applications lik...
M. Ani Hsieh, Ádám M. Halász,...
ISCI
2007
103views more  ISCI 2007»
14 years 11 months ago
Threshold-based declustering
Declustering techniques reduce query response time through parallel I/O by distributing data among multiple devices. Except for a few cases it is not possible to find declusterin...
Ali Saman Tosun
JAIR
2007
141views more  JAIR 2007»
14 years 11 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
TVLSI
2008
133views more  TVLSI 2008»
14 years 11 months ago
Test Data Compression Using Selective Encoding of Scan Slices
We present a selective encoding method that reduces test data volume and test application time for scan testing of Intellectual Property (IP) cores. This method encodes the slices ...
Zhanglei Wang, Krishnendu Chakrabarty
CAD
2004
Springer
14 years 11 months ago
Reduce the stretch in surface flattening by finding cutting paths to the surface boundary
This paper presents a method for finding cutting paths on a 3D triangular mesh surface to reduce the stretch in the flattened surface. The cutting paths link the surface boundary ...
Charlie C. L. Wang, Yu Wang 0010, Kai Tang, Matthe...