Sciweavers

7988 search results - page 1037 / 1598
» A Useful Undecidable Theory
Sort
View
TOC
2008
94views more  TOC 2008»
15 years 7 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
TOPLAS
2008
138views more  TOPLAS 2008»
15 years 7 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...
JASSS
2002
94views more  JASSS 2002»
15 years 7 months ago
The power of commitment in cooperative social action
This project presents an agent-based simulation model of protest activity. Agents are located in a two dimensional grid and have limited ability to observe the behavior of other a...
David Brichoux, Paul E. Johnson
229
Voted
JUCS
2010
176views more  JUCS 2010»
15 years 5 months ago
An Approach to Generation of Decision Rules
: Classical classification and clustering based on equivalence relations are very important tools in decision-making. An equivalence relation is usually determined by properties of...
Zhang Mingyi, Danning Li, Zhang Ying
MST
2010
101views more  MST 2010»
15 years 5 months ago
Non-Uniform Reductions
Reductions and completeness notions form the heart of computational complexity theory. Recently non-uniform reductions have been naturally introduced in a variety of settings conc...
Harry Buhrman, Benjamin J. Hescott, Steven Homer, ...
« Prev « First page 1037 / 1598 Last » Next »