1447 search results - page 220 / 290 » Graphs and Path Equilibria |
159
click to vote
ICCSA
2004
Springer
15 years 11 months ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
150
click to vote
ICCSA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
141
click to vote
ACSAC
2003
IEEE
15 years 11 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
148
click to vote
ISMIS
2003
Springer
15 years 11 months ago
2003
Springer
We discuss how mobile agents, moving in the Internet from node to node, can communicate with each other by forwarding messages in a robust way. As a solution, we present the genera...
165
click to vote
ISMVL
2010
IEEE
15 years 11 months ago
2010
IEEE
—Multiway Decision Graphs (MDGs) subsume Binary Decision Diagrams (BDDs) and extend them by a first-order formulae suitable for model checking of data path circuits. In this pap...