Sciweavers

1860 search results - page 333 / 372
» An Internet Based Development Framework for Reconfigurable C...
Sort
View
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
14 years 2 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
ICSOC
2004
Springer
14 years 2 months ago
An OGSA-based accounting system for allocation enforcement across HPC centers
In this paper, we present an Open Grid Services Architecture (OGSA)-based decentralized allocation enforcement system, developed with an emphasis on a consistent data model and ea...
Thomas Sandholm, Peter Gardfjäll, Erik Elmrot...
DAC
2005
ACM
14 years 9 months ago
Multilevel full-chip routing for the X-based architecture
As technology advances into the nanometer territory, the interconnect delay has become a first-order effect on chip performance. To handle this effect, the X-architecture has been...
Tsung-Yi Ho, Chen-Feng Chang, Yao-Wen Chang, Sao-J...
CCS
2005
ACM
14 years 2 months ago
Preventing attribute information leakage in automated trust negotiation
Automated trust negotiation is an approach which establishes trust between strangers through the bilateral, iterative disclosure of digital credentials. Sensitive credentials are ...
Keith Irwin, Ting Yu
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
14 years 1 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...