Sciweavers

13376 search results - page 2280 / 2676
» Problem Solving with
Sort
View
130
Voted
PARELEC
2002
IEEE
15 years 10 months ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
AGENTS
2001
Springer
15 years 9 months ago
Terrain coverage with ant robots: a simulation study
In this paper, we study a simple means for coordinating teams of simple agents. In particular, we study ant robots and how they can cover terrain once or repeatedly by leaving mar...
Sven Koenig, Yaxin Liu
DATE
2000
IEEE
93views Hardware» more  DATE 2000»
15 years 9 months ago
Fast Evaluation of Sequence Pair in Block Placement by Longest Common Subsequence Computation
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...
Xiaoping Tang, D. F. Wong, Ruiqi Tian
143
Voted
FGR
2000
IEEE
200views Biometrics» more  FGR 2000»
15 years 9 months ago
The Global Dimensionality of Face Space
Low-dimensional representations of sensory signals are key to solving many of the computational problems encountered in high-level vision. Principal Component Analysis (PCA) has b...
Penio S. Penev, Lawrence Sirovich
126
Voted
DAC
2000
ACM
15 years 9 months ago
Model-based dummy feature placement for oxide chemical-mechanical polishing manufacturability
—Chemical–mechanical polishing (CMP) is an enabling technique used in deep-submicrometer VLSI manufacturing to achieve long range oxide planarization. Post-CMP oxide topography...
Ruiqi Tian, D. F. Wong, Robert Boone
« Prev « First page 2280 / 2676 Last » Next »