4507 search results - page 380 / 902 » Generalized Binet dynamics |
157
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
180
click to vote
ICCD
2007
IEEE
16 years 3 months ago
2007
IEEE
In this paper, we present co-processor selection problem for minimum energy consumption in hw/sw co-design on FPGAs with dual power mode. We provide theoretical analysis for the p...
164
Voted
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
176
click to vote
ROBOCOMM
2007
IEEE
16 years 1 months ago
2007
IEEE
—Modeling and simulation can be powerful tools for analyzing multi-agent systems, such as networked robotic systems and sensor networks. In this paper, it is shown concretely how...
183
click to vote
CCS
2007
ACM
16 years 28 days ago
2007
ACM
In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degre...