Sciweavers

5243 search results - page 1029 / 1049
» Reasoning About Strategies
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 9 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
CORR
2010
Springer
259views Education» more  CORR 2010»
13 years 9 months ago
Community Detection in Networks: The Leader-Follower Algorithm
Natural networks such as those between humans observed through their interactions or biological networks predicted based on various experimental measurements contain a wealth of i...
Devavrat Shah, Tauhid Zaman
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 9 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
DCG
2008
118views more  DCG 2008»
13 years 9 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
AIM
2006
13 years 9 months ago
Comparative Analysis of Frameworks for Knowledge-Intensive Intelligent Agents
maintain awareness of its environment for a long period of time. Additionally, knowledge-intensive agents must be engineered such that their knowledge can be easily updated as envi...
Randolph M. Jones, Robert E. Wray III
« Prev « First page 1029 / 1049 Last » Next »