10051 search results - page 1669 / 2011 » A Dynamic Separator Algorithm |
118
click to vote
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
We study the problem of localizing repair packets when packets are lost. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast “group” wi...
151
click to vote
SIGMOD
1999
ACM
15 years 8 months ago
1999
ACM
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
157
Voted
ASIAN
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
138
Voted
ICCAD
1994
IEEE
15 years 8 months ago
1994
IEEE
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
166
Voted
BROADNETS
2004
IEEE
15 years 8 months ago
2004
IEEE
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...