13841 search results - page 279 / 2769 » Algorithms and Constraint Programming |
172
click to vote
ASPDAC
2000
ACM
15 years 11 months ago
2000
ACM
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
181
click to vote
ASPLOS
1992
ACM
15 years 10 months ago
1992
ACM
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
212
click to vote
GRID
2006
Springer
15 years 6 months ago
2006
Springer
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...
175
click to vote
CP
2005
Springer
16 years 5 days ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
207
click to vote
AAAI
2007
15 years 9 months ago
2007
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...