Sciweavers

395 search results - page 18 / 79
» Decision Problems for Convex Languages
Sort
View
ICALP
2001
Springer
13 years 12 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger
JUCS
2006
107views more  JUCS 2006»
13 years 7 months ago
Testing Membership in Formal Languages Implicitly Represented by Boolean Functions
Abstract: Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [Goldreich et al. (1998)] and inspired by Rubinfeld and Sudan in [Rubinfeld and Su...
Beate Bollig
CP
2009
Springer
14 years 8 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
EEE
2005
IEEE
14 years 1 months ago
A Pattern Language for Decentralized Coordination and Negotiation Protocols
Currently negotiation covers a huge and unstructured domain of negotiation- and coordination protocols and associated strategies. Researchers and practitioners like system enginee...
Adrian Paschke, Christine Kiss, Samer Al-Hunaty