Sciweavers

219 search results - page 1 / 44
» Combinatorial Complexity of Regular Languages
Sort
View
63
Voted
CSR
2008
Springer
14 years 11 months ago
Combinatorial Complexity of Regular Languages
Arseny M. Shur
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
14 years 10 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 1 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
JALC
2008
72views more  JALC 2008»
14 years 10 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
ASPLOS
2006
ACM
15 years 4 months ago
Combinatorial sketching for finite programs
Sketching is a software synthesis approach where the programmer develops a partial implementation — a sketch — and a separate specification of the desired functionality. The ...
Armando Solar-Lezama, Liviu Tancau, Rastislav Bod&...