Sciweavers

2861 search results - page 488 / 573
» Constraint Programming
Sort
View
MOZ
2004
Springer
14 years 3 months ago
Compositional Abstractions for Search Factories
ional Abstractions for Search Factories Guido Tack, Didier Le Botlan MOZ 2004 Presented at International Mozart/Oz Conference (MOZ 2004) Charleroi, Belgium October 2004 Published i...
Guido Tack, Didier Le Botlan
INFORMS
2010
138views more  INFORMS 2010»
13 years 8 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
JSC
2010
103views more  JSC 2010»
13 years 8 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
TWC
2008
113views more  TWC 2008»
13 years 10 months ago
Capacity of opportunistic routing in multi-rate and multi-hop wireless networks
Abstract-- Opportunistic routing (OR) copes with the unreliable transmissions by exploiting the broadcast nature of the wireless medium and spatial diversity of the multi-hop wirel...
Kai Zeng, Wenjing Lou, Hongqiang Zhai
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 10 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan