Sciweavers

7773 search results - page 208 / 1555
» On generalized Frame-Stewart numbers
Sort
View
GECCO
2010
Springer
233views Optimization» more  GECCO 2010»
15 years 11 months ago
Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs
The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) h...
Jirí Jaros, Vaclav Dvorak
SIGGRAPH
2010
ACM
15 years 11 months ago
Feature-aligned T-meshes
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
Ashish Myles, Nico Pietroni, Denis Kovacs, Denis Z...
IPPS
2000
IEEE
15 years 11 months ago
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
Qian-Ping Gu, Shietung Peng
MOBIDE
1999
ACM
15 years 10 months ago
Data Partitioning for Disconnected Client Server Databases
The use of mobile computers is gaining popularity. The number of users with laptops and notebooks is increasing and this trend is likely to continue in the future where the number...
Shirish Hemant Phatak, B. R. Badrinath
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 3 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...