11121 search results - page 153 / 2225 » Computing with Continuous Change |
132
Voted
ISTCS
1997
Springer
15 years 7 months ago
1997
Springer
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
160
click to vote
AAMAS
2005
Springer
15 years 3 months ago
2005
Springer
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
158
Voted
CCECE
2009
IEEE
15 years 10 months ago
2009
IEEE
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...
125
Voted
SEMWEB
2007
Springer
15 years 9 months ago
2007
Springer
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
116
Voted
PODC
2010
ACM
15 years 1 months ago
2010
ACM
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...