Sciweavers

674 search results - page 57 / 135
» Arguments and Results
Sort
View
ICCSA
2004
Springer
14 years 2 months ago
A Reduced Codification for the Logical Representation of Job Shop Scheduling Problems
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...
Juan Frausto Solís, Marco Antonio Cruz-Chav...
ICDCS
1999
IEEE
14 years 1 months ago
Scalable Processing of Read-Only Transactions in Broadcast Push
Recently, push-based delivery has attracted considerable attention as a means of disseminating information to large client populations in both wired and wireless settings. In this...
Evaggelia Pitoura, Panos K. Chrysanthis
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 8 months ago
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
We present an algorithm running in time O(n log n) which decides if a wreathclosed permutation class Av(B) given by its finite basis B contains a finite number of simple permutati...
Frédérique Bassino, Mathilde Bouvel,...
ICASSP
2010
IEEE
13 years 7 months ago
Video-based fingerprint verification
In this paper, fingerprint videos are used to improve the accuracy of a fingerprint verification system. We define the “inside-similarity” and “outside-similarity” to ...
Wei Qin, Yilong Yin, Chunxiao Ren, Lili Liu
INFOCOM
2011
IEEE
13 years 6 days ago
Scheduling for small delay in multi-rate multi-channel wireless networks
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM-based) wireless downlink systems. We show that the Server-Side Greedy (SSG) rul...
Shreeshankar Bodas, Sanjay Shakkottai, Lei Ying, R...