9842 search results - page 258 / 1969 » Problem complexity |
156
click to vote
USENIX
2000
15 years 8 months ago
2000
As the complexity of software increases, the size of the software tends to increase as well, which incurs longer compilation and build cycles. In this paper, the authors present o...
161
click to vote
DAM
2006
15 years 6 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
186
Voted
EAAI
2007
15 years 6 months ago
2007
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...
148
click to vote
TCAD
2008
15 years 6 months ago
2008
This paper presents a fast and accurate solution, namely Fashion, to routability-driven global routing problem. Fashion is based on two efficient yet effective techniques: 1) dynam...
180
Voted
SSPR
2010
Springer
15 years 5 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...