Sciweavers

1258 search results - page 193 / 252
» Architecture-driven Problem Decomposition
Sort
View
COMBINATORICA
2008
89views more  COMBINATORICA 2008»
13 years 9 months ago
The stable set polytope of quasi-line graphs
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier St...
CPHYSICS
2010
135views more  CPHYSICS 2010»
13 years 9 months ago
An events based algorithm for distributing concurrent tasks on multi-core architectures
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
David W. Holmes, John R. Williams, Peter Tilke
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 9 months ago
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 9 months ago
Crosstalk-free Conjugate Networks for Optical Multicast Switching
High-speed photonic switching networks can switch optical signals at the rate of several terabits per second. However, they suffer from an intrinsic crosstalk problem when two opti...
Yun Deng, Tony T. Lee
INFSOF
2006
129views more  INFSOF 2006»
13 years 8 months ago
An interactive service customization model
: Mass customization has become one of the key strategies for a service provider to differentiate itself from its competitors in a highly segmented global service market. This pape...
Jian Cao, Jie Wang, Kincho H. Law, Shen-sheng Zhan...