Sciweavers

8141 search results - page 1385 / 1629
» Higher Order Generalization
Sort
View
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 9 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
GG
2004
Springer
15 years 9 months ago
Workshop on Graph-Based Tools
Graphs are well-known, well-understood, and frequently used means to depict networks of related items. They are successfully used as the underlying mathematical concept in various ...
Tom Mens, Andy Schürr, Gabriele Taentzer
ICLP
2004
Springer
15 years 9 months ago
MProlog: An Extension of Prolog for Modal Logic Programming
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
Linh Anh Nguyen
VIZSEC
2004
Springer
15 years 9 months ago
Passive visual fingerprinting of network attack tools
This paper examines the dramatic visual fingerprints left by a wide variety of popular network attack tools in order to better understand the specific methodologies used by attack...
Gregory J. Conti, Kulsoom Abdullah
ICRA
2003
IEEE
144views Robotics» more  ICRA 2003»
15 years 9 months ago
Error-tolerant execution of complex robot tasks based on skill primitives
— This paper presents a general approach to specify and execute complex robot tasks considering uncertain environments. Robot tasks are defined by a precise definition of socal...
Ulrike Thomas, Bernd Finkemeyer, Torsten Krög...
« Prev « First page 1385 / 1629 Last » Next »