Sciweavers

601 search results - page 86 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 2 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
CONCUR
2000
Springer
15 years 5 months ago
LP Deadlock Checking Using Partial Order Dependencies
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
Victor Khomenko, Maciej Koutny
KDD
2012
ACM
292views Data Mining» more  KDD 2012»
13 years 3 months ago
Online allocation of display ads with smooth delivery
Display ads on the Internet are often sold in bundles of thousands or millions of impressions over a particular time period, typically weeks or months. Ad serving systems that ass...
Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 1 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
127
Voted
BROADNETS
2006
IEEE
15 years 5 months ago
Efficient Integration of Web Services in Ambient-aware Sensor Network Applications
Sensor webs are heterogeneous collections of sensor devices that collect information and interact with the environment. They consist of wireless sensor networks that are ensembles ...
Isaac Amundson, Manish Kushwaha, Xenofon D. Koutso...