Sciweavers

1332 search results - page 167 / 267
» Combinatorial Algorithms
Sort
View
TCAD
2002
85views more  TCAD 2002»
13 years 8 months ago
Architectural energy optimization by bus splitting
This paper proposes split shared-bus architecture to reduce the energy dissipation for global data exchange among a set of interconnected modules. The bus splitting problem for mi...
Cheng-Ta Hsieh, Massoud Pedram
WWW
2009
ACM
14 years 9 months ago
Quicklink selection for navigational query results
Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page, and that let the users directly jump to selected points inside t...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
ALMOB
2006
80views more  ALMOB 2006»
13 years 9 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
GPEM
2002
163views more  GPEM 2002»
13 years 9 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
COMPGEOM
2007
ACM
14 years 1 months ago
An optimal generalization of the centerpoint theorem, and its extensions
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
Saurabh Ray, Nabil H. Mustafa