Sciweavers

15351 search results - page 2991 / 3071
» The information bottleneck method
Sort
View
COMPGEOM
1987
ACM
13 years 11 months ago
Polygon Properties Calculated from the Vertex Neighborhoods
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
Wm. Randolph Franklin
ATAL
2009
Springer
13 years 11 months ago
Choice, interoperability, and conformance in interaction protocols and service choreographies
Many real-world applications of multiagent systems require independently designed (heterogeneous) and operated (autonomous) agents to interoperate. We consider agents who offer bu...
Matteo Baldoni, Cristina Baroglio, Amit K. Chopra,...
AIPS
2010
13 years 10 months ago
Shopper: A System for Executing and Simulating Expressive Plans
We present Shopper, a plan execution engine that facilitates experimental evaluation of plans and makes it easier for planning researchers to incorporate replanning. Shopper inter...
Robert P. Goldman, John Maraist
AOSD
2008
ACM
13 years 9 months ago
Modularity first: a case for mixing AOP and attribute grammars
We have reimplemented the frontend of the extensible AspectBench Compiler for AspectJ, using the aspect-oriented meta-compiler JastAdd. The original frontend was purely object-ori...
Pavel Avgustinov, Torbjörn Ekman, Julian Tibb...
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
« Prev « First page 2991 / 3071 Last » Next »