Sciweavers

5243 search results - page 283 / 1049
» Reasoning About Strategies
Sort
View
CEC
2009
IEEE
16 years 1 months ago
Evolution of cooperation on different pairs of interaction and replacement networks with various intensity of selection
— There are various discussions on the evolution of cooperation on different pairs of interaction network for playing games and the replacement network for imitation of strategie...
Reiji Suzuki, Takaya Arita
INFOCOM
2005
IEEE
16 years 10 days ago
Fairness and optimal stochastic control for heterogeneous networks
— We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic w...
Michael J. Neely, Eytan Modiano, Chih-Ping Li
SRDS
1999
IEEE
15 years 11 months ago
Information Dissemination in Partitionable Mobile Ad Hoc Networks
Ad-hoc wireless networks have no wired component, and may have unpredictable mobility pattern. Such networks can get partitioned and reconnected several times. One possible approa...
Goutham Karumanchi, Srinivasan Muralidharan, Ravi ...
CP
2010
Springer
15 years 5 months ago
Heuristics for Planning with SAT
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Jussi Rintanen
VL
2010
IEEE
286views Visual Languages» more  VL 2010»
15 years 5 months ago
A Debugging Perspective on End-User Mashup Programming
In recent years, systems have emerged that enable end users to “mash” together existing web services to build new web sites. However, little is known about how well end users ...
Jill Cao, Kyle Rector, Thomas H. Park, Scott D. Fl...