#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1975

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marek Chrobak, Christoph DÃ¼rr, Mathilde Hurand, Julien Robert
- AAIM
- 2008

We study scheduling problems motivated by recently developed techniques for microprocessor thermal management at the operating systems level. The general scenario can be described as follows. Theâ€¦ (More)

- Richard E. Michod, Yannick Viossat, Cristian A. Solari, Mathilde Hurand, Aurora M Nedelcu
- Journal of theoretical biology
- 2006

The fitness of an evolutionary individual can be understood in terms of its two basic components: survival and reproduction. As embodied in current theory, trade-offs between these fitness componentsâ€¦ (More)

- Marek Chrobak, Mathilde Hurand
- WAOA
- 2007

In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 âŠ† F2 âŠ† .... âŠ† Fn, where each Fk contains at most k facilities. Weâ€¦ (More)

- Christoph DÃ¼rr, Mathilde Hurand
- Algorithmica
- 2006

A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instanceâ€¦ (More)

- Marek Chrobak, Mathilde Hurand, JirÃ Sgall
- 28th IEEE International Real-Time Systemsâ€¦
- 2007

In queue-based scheduling systems jobs are executed according to a predefined sequential plan. During execution, faults may occur that cause jobs to re-execute, thus delaying the whole schedule. Itâ€¦ (More)

- Marcin Bienkowski, Marek Chrobak, +5 authors Grzegorz Stachowiak
- ArXiv
- 2008

We consider online competitive algorithms for the problem of collecting weighted items from<lb>a dynamic set S, when items are added to or deleted from S over time. The objective is<lb>to maximizeâ€¦ (More)

- INSTYTUT INFORMATYKI, UNIWERSYTETU WROC, +7 authors Grzegorz Stachowiak
- 2008

We consider online competitive algorithms for the problem of collecting weighted items from a dynamic set S, when items are added to or deleted from S over time. The objective is to maximize theâ€¦ (More)

- Marcin Bienkowski, Marek Chrobak, +4 authors Grzegorz Stachowiak
- Algorithmica
- 2009

We consider online competitive algorithms for the problem of collecting weighted items from a dynamic queue S. The content of S varies over time. An update to S can occur between any two consecutiveâ€¦ (More)

Given n jobs of equal processing time p, we wish to find a schedule on m parallel machines, where each job j is scheduled in a given interval [rj , Dj). This problem can be solved in time O(n logn)â€¦ (More)

- Marcin Bienkowski, Marek Chrobak, +4 authors Grzegorz Stachowiak
- Theor. Comput. Sci.
- 2013

The bounded-delay packet scheduling (or buffer management) problem is to schedule transmissions of packets arriving in a buffer of a network link. Each packet has a deadline and a weight associatedâ€¦ (More)