Ask
Search
My library

About
Statistics
Contact
Data Protection
Accessibility
Imprint
Changelog
Frontend: v1.31.3
Backend: v1.11.4

We use cookies to provide a better user experience.

Data Protection

New approximation algorithms for some dynamic storage allocation problems

Li, S.C.
Leong, H.W.
Quek, S.K.

Publication date

January 2004

DOI

10.1007/978-3-540-27798-9_37

ISSN

0302-9743

Citation count (estimate)

6

Abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)3106339-34

Extracted data

Related items

Compressed indexes for approximate string matching

Chan, H.-L.
Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Wong, S.-S.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Multimedia analysis and synthesis

Kankanhalli, M.S.

January 2003

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)290341-52LN...

On the data consumption benefits of accepting increased uncertainty

Martin, E.
Sharma, A.
Stephan, F.

January 2004

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)324483-98LN...

A probing approach for effective distributed resource reservation

Yuan, L.
Tham, C.-K.
Ananda, A.L.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

The General Yard Allocation Problem

Chen, P.
Fu, Z.
Lim, A.
Rodrigues, B.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Dealing with hard problems Lecture notes on approximation algorithms and randomized algorithms

Chvatal, V.
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1990

SIGLETIB: RN 4052(90646-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

A polynomial time approximation algorithm for dynamic storage allocation

Kierstead, H.A.

April 1991

AbstractWe use an on-line algorithm for coloring interval graphs to construct a polynomial time appr...

A new clustering algorithm for transaction data via caucus

Xu, J.
Xiong, H.
Sung, S.Y.
Kumar, V.

January 2003

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)2637551-562...

Resource usage verification

Marriott, K.
Stuckey, P.J.
Sulzmann, M.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

State management issues and grid services

Xie, Y.
Teo, Y.-M.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Approximation algorithms for the consecutive ones submatrix problem on sparse matrices

Tan, J.
Zhang, L.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Approximation Algorithms and Heuristics for the Dynamic Storage Allocation Problem

Praveen K. Murthy
Shuvra S. Bhattacharyya

January 1999

In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...

Efficient dynamic operator placement in a locally distributed continuous query system

Zhou, Y.
Ooi, B.C.
Tan, K.-L.
Wu, J.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

On solving the partial MAX-SAT problem

Fu, Z.
Malik, S.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Subdividing alpha complex

Cheng, H.-L.
Tan, T.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Compressed indexes for approximate string matching

Chan, H.-L.
Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Wong, S.-S.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Multimedia analysis and synthesis

Kankanhalli, M.S.

January 2003

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)290341-52LN...

On the data consumption benefits of accepting increased uncertainty

Martin, E.
Sharma, A.
Stephan, F.

January 2004

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)324483-98LN...

A probing approach for effective distributed resource reservation

Yuan, L.
Tham, C.-K.
Ananda, A.L.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

The General Yard Allocation Problem

Chen, P.
Fu, Z.
Lim, A.
Rodrigues, B.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Dealing with hard problems Lecture notes on approximation algorithms and randomized algorithms

Chvatal, V.
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1990

SIGLETIB: RN 4052(90646-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

A polynomial time approximation algorithm for dynamic storage allocation

Kierstead, H.A.

April 1991

AbstractWe use an on-line algorithm for coloring interval graphs to construct a polynomial time appr...

A new clustering algorithm for transaction data via caucus

Xu, J.
Xiong, H.
Sung, S.Y.
Kumar, V.

January 2003

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)2637551-562...

Resource usage verification

Marriott, K.
Stuckey, P.J.
Sulzmann, M.

January 2003

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

State management issues and grid services

Xie, Y.
Teo, Y.-M.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Approximation algorithms for the consecutive ones submatrix problem on sparse matrices

Tan, J.
Zhang, L.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Approximation Algorithms and Heuristics for the Dynamic Storage Allocation Problem

Praveen K. Murthy
Shuvra S. Bhattacharyya

January 1999

In this report, we look at the problem of packing a number of arrays in memory efficiently. This is ...

Efficient dynamic operator placement in a locally distributed continuous query system

Zhou, Y.
Ooi, B.C.
Tan, K.-L.
Wu, J.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

On solving the partial MAX-SAT problem

Fu, Z.
Malik, S.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Subdividing alpha complex

Cheng, H.-L.
Tan, T.

January 2004

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Compressed indexes for approximate string matching

Chan, H.-L.
Lam, T.-W.
Sung, W.-K.
Tam, S.-L.
Wong, S.-S.

January 2006

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and ...

Multimedia analysis and synthesis

Kankanhalli, M.S.

January 2003

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)290341-52LN...

On the data consumption benefits of accepting increased uncertainty

Martin, E.
Sharma, A.
Stephan, F.

January 2004

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)324483-98LN...