Sciweavers

543 search results - page 27 / 109
» New Upper Bounds for MaxSat
Sort
View
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
14 years 7 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
ICML
2009
IEEE
15 years 10 months ago
The adaptive k-meteorologists problem and its application to structure learning and feature selection in reinforcement learning
The purpose of this paper is three-fold. First, we formalize and study a problem of learning probabilistic concepts in the recently proposed KWIK framework. We give details of an ...
Carlos Diuk, Lihong Li, Bethany R. Leffler
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 9 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg
CORR
2010
Springer
168views Education» more  CORR 2010»
14 years 7 months ago
Bounds on the maximum multiplicity of some common geometric graphs
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
Adrian Dumitrescu, André Schulz, Adam Sheff...
ANOR
2008
171views more  ANOR 2008»
14 years 9 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet