2095 search results - page 214 / 419 » Improved pebbling bounds |
193
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
163
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
154
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
162
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
The Leading Zero Anticipator (LZA) is one of the main components used in floating point addition. It tends to be on the critical path, so it has attracted the attention of many r...
170
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— In this paper we obtain information theoretical conditions for tracking in linear time-invariant control systems. We consider the particular case where the closed loop contains...