Sciweavers

976 search results - page 30 / 196
» The Complexity of Timetable Construction Problems
Sort
View
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
13 years 11 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
ALGOSENSORS
2008
Springer
13 years 9 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
VIS
2007
IEEE
111views Visualization» more  VIS 2007»
14 years 8 months ago
Construction of Simplified Boundary Surfaces from Serial-sectioned Metal Micrographs
We present a method for extracting boundary surfaces from segmented cross-section image data. We use a constrained Potts model to interpolate an arbitrary number of region boundar...
Scott E. Dillard, John F. Bingert, Dan Thoma, B...
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
14 years 29 days ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
ISPD
2003
ACM
88views Hardware» more  ISPD 2003»
14 years 19 days ago
Porosity aware buffered steiner tree construction
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jia...