Sciweavers

4463 search results - page 588 / 893
» computer 2000
Sort
View
143
Voted
ECCC
2000
93views more  ECCC 2000»
15 years 4 months ago
Security of the Most Significant Bits of the Shamir Message Passing Scheme
Boneh and Venkatesan have recently proposed a polynomial time algorithm for recovering a "hidden" element of a finite field Fp of p elements from rather short strings of...
Maria Isabel Gonzalez Vasco, Igor Shparlinski
196
Voted
ENDM
2000
121views more  ENDM 2000»
15 years 4 months ago
Finding the chromatic number by means of critical graphs
We propose a new exact algorithm for finding the chromatic number of a graph G. The algorithm attempts to determine the smallest possible induced subgraph G' of G which has t...
Francine Herrmann, Alain Hertz
EOR
2000
115views more  EOR 2000»
15 years 4 months ago
An effective implementation of the Lin-Kernighan traveling salesman heuristic
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
Keld Helsgaun
ETS
2000
IEEE
90views Hardware» more  ETS 2000»
15 years 4 months ago
Teacher Collaboration in a Networked Community
In this paper, we examine the collaboration problems teachers encountered in the course of instructing students using collaborative computer software to connect distributed classr...
Daniel R. Dunlap, Dennis C. Neale, John M. Carroll
FGCS
2000
145views more  FGCS 2000»
15 years 4 months ago
Ant algorithms and stigmergy
Ant colonies, and more generally social insect societies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organiz...
Marco Dorigo, Eric Bonabeau, Guy Theraulaz