983 search results - page 60 / 197 » Negative-Weight Cycle Algorithms |
112
click to vote
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
This paper addresses the multi-agent patrolling problem, which consists for a set of autonomous agents to visit all the places of an unknown environment as regularly as possible. T...
121
click to vote
SEFM
2008
IEEE
15 years 9 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...
157
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
102
click to vote
JOC
1998
15 years 2 months ago
1998
We describe a software-e cient encryption algorithm named SEAL 3.0. Computational cost on a modern 32-bit processor is about 4 clock cycles per byte of text. The cipher is a pseudo...
115
click to vote
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
— As across-chip wire delays exceed a clock cycle, interconnect pipelining becomes essential. However, the arbitrary insertion of flip-flops can change the differentials of lat...