Sciweavers

8695 search results - page 47 / 1739
» Making the Complex Simple
Sort
View
ISAAC
1993
Springer
87views Algorithms» more  ISAAC 1993»
14 years 4 days ago
Finding the Shortest Watchman Route in a Simple Polygon
We present the first polynomial time algorithm that finds the shortest route in a simple polygon such that all points of the polygon are visible from the route. This route is cal...
Svante Carlsson, Håkan Jonsson, Bengt J. Nil...
CP
2008
Springer
13 years 9 months ago
Optimization of Simple Tabular Reduction for Table Constraints
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
Christophe Lecoutre
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 8 months ago
Programs as polygraphs: computability and complexity
Abstract – This study presents Albert Burroni’s polygraphs as an algebraic and graphical description of first-order functional programs, where functions can have many outputs....
Guillaume Bonfante, Yves Guiraud
REFLECTION
2001
Springer
14 years 15 days ago
A Simple Security-Aware MOP for Java
This article investigates the security problems raised by the use of proxy-based runtime meta-object protocols (MOPs) for Java and provides an approach for making meta-level code t...
Denis Caromel, Fabrice Huet, Julien Vayssiè...
IJNSEC
2008
115views more  IJNSEC 2008»
13 years 8 months ago
A Simple User Authentication Scheme for Grid Computing
The security issue has become an important concern of grid computing. To prevent the grid resources from being illegally visited, the strong mutual authentication is needed for us...
Rongxing Lu, Zhenfu Cao, Zhenchuan Chai, Xiaohui L...