125 search results - page 24 / 25 » N Semantic Classes are Harder than Two |
96
Voted
IOR
2007
14 years 11 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
126
Voted
PODS
1995
ACM
15 years 3 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
AI
2004
Springer
14 years 11 months ago
2004
Springer
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to u...
92
Voted
SIGCOMM
2010
ACM
14 years 12 months ago
2010
ACM
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...
125
click to vote
KDD
2009
ACM
16 years 6 days ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...