Sciweavers

3053 search results - page 550 / 611
» Performance of Generative Programming Based Protocol Impleme...
Sort
View
IJCAI
2007
13 years 10 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...
AIPS
2006
13 years 10 months ago
Tractable Optimal Competitive Scheduling
In this paper we describe the problem of Optimal Competitive Scheduling, which consists of activities that compete for a shared resource. The objective is to choose a subset of ac...
Jeremy Frank, James Crawford, Lina Khatib, Ronen I...
ICASSP
2010
IEEE
13 years 9 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Heuristics in Conflict Resolution
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
CORR
2006
Springer
100views Education» more  CORR 2006»
13 years 9 months ago
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
Peyman Razaghi, Wei Yu