2001 search results - page 266 / 401 » An Update on Generalized Information Theory |
181
Voted
INFORMS
2010
15 years 5 months ago
2010
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...
215
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
202
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
176
click to vote
CIKM
2004
Springer
16 years 11 days ago
2004
Springer
We study the representation, derivation and utilization of a special kind of constraints in multidatabase systems. A major challenge is when component database schemas are schemat...
170
click to vote
WPES
2005
ACM
16 years 16 days ago
2005
ACM
This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the a...