Sciweavers

656 search results - page 53 / 132
» Minimal non-convex words
Sort
View
IPL
2008
114views more  IPL 2008»
14 years 10 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
DAM
2007
100views more  DAM 2007»
14 years 9 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
JWSR
2008
147views more  JWSR 2008»
14 years 9 months ago
Karma2: Provenance Management for Data-Driven Workflows
: The increasing ability for the sciences to sense the world around us is resulting in a growing need for data driven applications that are under the control of workflows composed ...
Yogesh L. Simmhan, Beth Plale, Dennis Gannon
JOC
2006
116views more  JOC 2006»
14 years 9 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
EOR
2007
102views more  EOR 2007»
14 years 9 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux