1568 search results - page 68 / 314 » The problem of examination questions in algorithmics |
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
TON
2008
14 years 9 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
86
Voted
CAAN
2007
Springer
15 years 4 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
ICCAD
2005
IEEE
15 years 7 months ago
2005
IEEE
— In this paper we are concerned with developing more reliable model reduction algorithms. We have focused on less common, but real, examples that fail to be effectively reduced ...
65
Voted
AI
2005
Springer
14 years 10 months ago
2005
Springer
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...