Sciweavers

1245 search results - page 74 / 249
» Playing with Conway's problem
Sort
View
TCS
2008
13 years 7 months ago
Making the use of maximal ideals constructive
The purpose of this paper is to decipher constructively a lemma of Suslin which played a central role in his second solution of Serre's problem on projective modules over pol...
Ihsen Yengui
FGCS
2000
145views more  FGCS 2000»
13 years 7 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
CSC
2010
13 years 5 months ago
An Evaluation of Parallel Knapsack Algorithms on Multicore Architectures
Emergence of chip multiprocessor systems has dramatically increased the performance potential of computer systems. Since the amount of exploited parallelism is directly influenced ...
Hammad Rashid, Clara Novoa, Apan Qasem
INFOCOM
2010
IEEE
13 years 5 months ago
Counting RFID Tags Efficiently and Anonymously
Radio Frequency IDentification (RFID) technology has attracted much attention due to its variety of applications, e.g., inventory control and object tracking. One important problem...
Hao Han, Bo Sheng, Chiu Chiang Tan, Qun Li, Weizhe...
ENDM
2010
115views more  ENDM 2010»
13 years 5 months ago
On the knapsack closure of 0-1 Integer Linear Programs
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
Matteo Fischetti, Andrea Lodi