6404 search results - page 1047 / 1281 » Blocks |
133
click to vote
DAM
2008
15 years 5 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
170
Voted
DISOPT
2008
15 years 5 months ago
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an important and difficult area for which there is a need for developing new methods and software f...
170
click to vote
EC
2008
15 years 5 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
126
Voted
ENGL
2008
15 years 5 months ago
2008
Abstract--Over-sampling sigma-delta analog-todigital converters (ADCs) are one of the key building blocks of state of the art wireless transceivers. In sigma-delta modulator design...
144
Voted
ENTCS
2008
15 years 5 months ago
2008
Timing Closure in presence of long global wire interconnects is one of the main current issues in System-onChip design. One proposed solution to the Timing Closure problem is Late...