Sciweavers

706 search results - page 74 / 142
» Super Solutions in Constraint Programming
Sort
View
ICLP
2004
Springer
15 years 5 months ago
Non-viability Deductions in Arc-Consistency Computation
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
Camilo Rueda, Frank D. Valencia
BIS
2008
119views Business» more  BIS 2008»
15 years 1 months ago
Fuzzy Constraint-based Schema Matching Formulation
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
ICCV
2009
IEEE
16 years 4 months ago
Filter Flow
The filter flow problem is to compute a space-variant linear filter that transforms one image into another. This framework encompasses a broad range of transformations including...
Steven M. Seitz, Simon Baker
84
Voted
NIPS
2007
15 years 1 months ago
Sequential Hypothesis Testing under Stochastic Deadlines
Most models of decision-making in neuroscience assume an infinite horizon, which yields an optimal solution that integrates evidence up to a fixed decision threshold; however, u...
Peter Frazier, Angela Yu
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
14 years 12 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker