8259 search results - page 264 / 1652 » On Generalized Feistel Networks |
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks wit...
100
click to vote
CORR
2008
Springer
15 years 25 days ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
120
Voted
JCT
2008
15 years 22 days ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
70
Voted
DEDS
2007
15 years 22 days ago
2007
This paper deals with just in time control of (max, +)-linear systems. The output tracking problem, considered in previous studies, is generalized by considering additional constr...
98
Voted
JUCS
2010
14 years 11 months ago
2010
: In this paper we consider a multiagent system with multiple ontologies. The agents maintain the ontologies individually which leads to frequent changes and possible knowledge inc...