8695 search results - page 148 / 1739 » Making the Complex Simple |
122
Voted
DC
2010
14 years 7 months ago
2010
First-Come-First-Served (FCFS) mutual exclusion (ME) is the problem of ensuring that processes attempting to concurrently access a shared resource do so one by one, in a fair order...
131
click to vote
DEBS
2009
ACM
15 years 7 months ago
2009
ACM
The nature of data in enterprises and on the Internet is changing. Data used to be stored in a database first and queried later. Today timely processing of new data, represented ...
111
click to vote
KR
2004
Springer
15 years 6 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
114
Voted
COCO
1995
Springer
15 years 4 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
110
click to vote
FTDCS
2003
IEEE
15 years 6 months ago
2003
IEEE
The global information service in the Internet is a heterogeneous and rapidly evolving environment. Constantly, new information services are added, others are modified, removed or...