1594 search results - page 254 / 319 » An Algorithm to Compute Collusion Paths |
140
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Westudyjobschedulingonprocessorscapableofrunningatvariablevoltage/speed tominimizeenergyconsumption.Eachjob ina probleminstanceisspecifiedbyitsarrivaltime and deadline, together w...
178
click to vote
ICN
2001
Springer
15 years 10 months ago
2001
Springer
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
161
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
196
click to vote
CONCUR
1997
Springer
15 years 10 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
166
click to vote
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper presents a novel effective scheme of configuring Wireless Personal Area Networks (WPANs), called Master-driven Connection Control (MaCC). WPANs are based on a new wirel...