1102 search results - page 122 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
97
Voted
ASPDAC
2008
ACM
15 years 2 months ago
2008
ACM
Traditionally, clock network layout is performed after cell placement. Such methodology is facing a serious problem in nanometer IC designs where people tend to use huge clock buff...
145
Voted
ICSOC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Service-based systems should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. It may however be the case tha...
107
Voted
IJSNET
2007
15 years 16 days ago
2007
— In this paper, the problem of distributed neutralization of toxic 2D diffusion process is discussed. The diffusion process is modelled by a parabolic PDE system. A group of mob...
109
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
116
click to vote
AAAI
2008
15 years 3 months ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...