3172 search results - page 506 / 635 » On the Random-Self-Reducibility of Complete Sets |
157
click to vote
LREC
2008
15 years 8 months ago
2008
Data models and encoding formats for syntactically annotated text corpora need to deal with syntactic ambiguity; underspecified representations are particularly well suited for th...
181
click to vote
IJCAI
2007
15 years 8 months ago
2007
We consider how to combine the preferences of multiple agents despite the presence of incompleteness and incomparability in their preference orderings. An agent’s preference orde...
162
click to vote
IPCO
2007
15 years 8 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
193
click to vote
SDM
2007
SIAM
15 years 8 months ago
2007
SIAM
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
171
click to vote
FLAIRS
2004
15 years 7 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...