Sciweavers

7167 search results - page 1245 / 1434
» A Technique for Invariant Generation
Sort
View
AAAI
1998
15 years 8 months ago
Fast Probabilistic Modeling for Combinatorial Optimization
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
Shumeet Baluja, Scott Davies
WEBNET
1997
15 years 8 months ago
Beyond Java: An Infrastructure for High-Performance Mobile Code on the World Wide Web
: We are building an infrastructure for the platform-independent distribution and execution of high-performance mobile code as a future Internet technology to complement and perhap...
Michael Franz
APCCM
2009
15 years 8 months ago
Extracting Conceptual Graphs from Japanese Documents for Software Requirements Modeling
A requirements analysis step plays a significant role on the development of information systems, and in this step we various kinds of abstract models of the systems (called requir...
Ryo Hasegawa, Motohiro Kitamura, Haruhiko Kaiya, M...
CRYPTO
2010
Springer
188views Cryptology» more  CRYPTO 2010»
15 years 8 months ago
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Homomorphic encryption (HE) schemes enable computing functions on encrypted data, by means of a public Eval procedure that can be applied to ciphertexts. But the evaluated ciphert...
Craig Gentry, Shai Halevi, Vinod Vaikuntanathan
GECCO
2008
Springer
182views Optimization» more  GECCO 2008»
15 years 8 months ago
Scaling ant colony optimization with hierarchical reinforcement learning partitioning
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
Erik J. Dries, Gilbert L. Peterson
« Prev « First page 1245 / 1434 Last » Next »