Sciweavers

11740 search results - page 385 / 2348
» More Problems in Rewriting
Sort
View
EUROCRYPT
2008
Springer
15 years 8 months ago
Key Recovery on Hidden Monomial Multivariate Schemes
Abstract. The problem we study in this paper is the key recovery problem on the C schemes and generalizations where the quadratic monomial of C (the product of two linear monomials...
Pierre-Alain Fouque, Gilles Macario-Rat, Jacques S...
AAAI
2004
15 years 8 months ago
Space-Efficient Memory-Based Heuristics
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
Rong Zhou, Eric A. Hansen
MASCOTS
2003
15 years 8 months ago
A Packet-Level Simulation Study of Optimal Web Proxy Cache Placement
The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response t...
Gwen Houtzager, Carey L. Williamson
AIPS
2000
15 years 8 months ago
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by prop...
Amnon Lotem, Dana S. Nau
SODA
2003
ACM
125views Algorithms» more  SODA 2003»
15 years 8 months ago
Random MAX SAT, random MAX CUT, and their phase transitions
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...