Sciweavers

8699 search results - page 1382 / 1740
» Elements of the Theory of Computation
Sort
View
FUIN
2007
134views more  FUIN 2007»
15 years 6 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
SIAMAM
2008
170views more  SIAMAM 2008»
15 years 6 months ago
Absolute Stability and Complete Synchronization in a Class of Neural Fields Models
Neural fields are an interesting option for modelling macroscopic parts of the cortex involving several populations of neurons, like cortical areas. Two classes of neural field equ...
Olivier D. Faugeras, François Grimbert, Jea...
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
IM
2007
15 years 6 months ago
In-Degree and PageRank: Why Do They Follow Similar Power Laws?
PageRank is a popularity measure designed by Google to rank Web pages. Experiments confirm that PageRank values obey a power law with the same exponent as In-Degree values. This ...
Nelly Litvak, Werner R. W. Scheinhardt, Yana Volko...
TOPLAS
2008
138views more  TOPLAS 2008»
15 years 6 months ago
Decomposing bytecode verification by abstract interpretation
act Interpretation C. BERNARDESCHI, N. DE FRANCESCO, G. LETTIERI, L. MARTINI, and P. MASCI Universit`a di Pisa Bytecode verification is a key point in the security chain of the Jav...
Cinzia Bernardeschi, Nicoletta De Francesco, Giuse...
« Prev « First page 1382 / 1740 Last » Next »