46 search results - page 1 / 10 » Approximated Consistency for the Automatic Recording Problem |
CP
2005
Springer
13 years 10 months ago
2005
Springer
CP
2003
Springer
13 years 10 months ago
2003
Springer
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
AAAI
2004
13 years 6 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
AAAI
2006
13 years 6 months ago
2006
This paper is concerned with the problem of structured data extraction from Web pages. The objective of the research is to automatically segment data records in a page, extract da...
TON
2012
11 years 7 months ago
2012
—The inherent measurement support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problem...