Treffer 161 - 180 von 690

161

On-line stream merging in a general setting
CHAN, Wun-Tat ; LAM, Tak-Wah ; TING, Hing-Fung ; et al.
Computing and combinatorics (COCOON 2001), Guilin, China, August 20-23, 2001Theoretical computer science. 296(1):27-46

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
162

On-line stream merging, max span, and min coverage
CHAN, Wun-Tat ; LAM, Tak-Wah ; TING, Hing-Fung ; et al.
Algorithms and complexity (Rome, 28-30 May 2003)Lecture notes in computer science. :70-82

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
163

On-line scheduling with tight deadlines
KOO, Chiu-Yuen ; LAM, Tak-Wah ; NGAN, Tsuen-Wan ; et al.
Mathematical foundations of computer science (MFCS 2001)Theoretical computer science. 295(1-3):251-261

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
164

On-demand broadcasting under deadline
KALYANASUNDARAM, Bala ; VELAUTHAPILLAI, Mahe
Algorithms - ESA 2003 (Budapest, 16-19 September 2003)Lecture notes in computer science. :313-324

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Konferenz
Zu den Favoriten
165

Non-clairvoyant scheduling for minimizing mean slowdown
BANSAL, N ; DHAMDHERE, K ; KÖNEMANN, J ; et al.
STACS 2003 : 20th annual symposium on theoretical aspects of computer science (Berlin, 27 February - 1 March 2003)Lecture notes in computer science. :260-270

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
166

News from the online traveling repairman
KTUMKE, Sven O ; DE PAEPE, Willem E ; POENSGEN, Diana ; et al.
Mathematical foundations of computer science (MFCS 2001)Theoretical computer science. 295(1-3):279-294

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences et techniques c... Sciences and techniques...
Konferenz
Zu den Favoriten
167

Maximizing job completions online
KALYANASUNDARAM, Bala ; PRUHS, Kirk R
1998 European Symposium on AlgorithmsJournal of algorithms (Print). 49(1):63-85

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Konferenz
Zu den Favoriten
168

Improved competitive algorithms for online scheduling with partial job values
CHIN, Francis Y. L ; FUNG, Stanley P. Y
COCOON 2003 : computing and combinatorics (Big Sky MT, 25-28 July 2003)Lecture notes in computer science. :425-434

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Konferenz
Zu den Favoriten
169

Expectation-minimax approach to clustering analysis
CHEUNG, Yiu-Ming
Artificial neural networks and neural information processing - ICANN / ICONIP 2003 (Istanbul, 26-29 June 2003)Lecture notes in computer science. :165-172

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
170

Constructing Disjoint paths for secure communication
BAGCHI, Amitabha ; CHAUDHARY, Amitabh ; GOODRICH, Michael T ; et al.
DISC 2003 : distributed computing (Sorrento, 1-3 October 2003)Lecture notes in computer science. :181-195

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
171

Competitive on-line stream merging algorithms for media-on-demand
BAR-NOY, Amotz ; LADNER, Richard E
Twelfth Annual ACM-SIAM Symposium on Discrete AlgorithmsJournal of algorithms (Print). 48(1):59-90

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Konferenz
Zu den Favoriten
172

A randomized satisfiability procedure for arithmetic and uninterpreted function symbols
GULWANI, Sumit ; NECULA, George C
Automated deduction - CADE-19 (Miami Beach FL, 28 July - 2 August 2003)Lecture notes in computer science. :167-181

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
173

A message authentication code based on unimodular matrix groups
CARY, Matthew ; VENKATESAN, Ramarathnam
Advances in cryptology : CRYPTO 2003 (Santa Barbara CA, 17-21 August 2003)Lecture notes in computer science. :500-512

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
174

A competitive neural network based on dipoles
GARCIA-BERNAL, M. A ; MUNOZ-PEREZ, J ; GOMEZ-RUIZ, J. A ; et al.
Computational methods in neural modeling (Mao, 3-6 June 2003)Lecture notes in computer science. :398-405

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
175

A SAT-based approach to multiple sequence alignment
PRESTWICH, Steven ; HIGGINS, Des ; O'SULLIVAN, Orla
CP 2003 : principles and practice of constraint programming (Kinsale, 29 September - 3 October 2003)Lecture notes in computer science. :940-944

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
176

Tracking the best level set in a level-crossing analog-to-digital converter
Kozat, S.S. ; Guan, K.M. ; Singer, A.C.
Digital Signal Processing
Digital Signal Processing: A Review Journal

Analog to digital conver... Level Set Adaptive Level-crossing 02 engineering and techn... Competitive algorithms Adaptive level-crossing
Fachzeitschrift
Zu den Favoriten
177

Towards fewer parameters for SAT clause weighting algorithms
THORNTON, John ; PULLAN, Wayne ; TERRY, Justin
AI 2002 : advances in artificial intelligence (Canberra, 2-6 December 2002)Lecture notes in computer science. :569-578

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
178

Simple and fast: Improving a branch-and-bound algorithm for maximum clique
FAHLE, Torsten
Algorithms - ESA 2002 (Rome, 17-21 September 2002)Lecture notes in computer science. :485-498

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
179

Preemptive scheduling in overloaded systems
CHROBAK, Marek ; EPSTEIN, Leah ; NOGA, John ; et al.
Automata, languages and programming (Malaga, 8-13 July 2002)Lecture notes in computer science. :800-811

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Konferenz
Zu den Favoriten
180

Optimal non-preemptive semi-online scheduling on two related machines
EPSTEIN, Leah ; FAVRHOLDT, Lene M
MFCS 2002 : mathematical foundations of computer science (Warsaw, 26-30 August 2002)Lecture notes in computer science. :245-256

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Konferenz
Zu den Favoriten

Filter