379 search results - page 57 / 76 » Strong reducibility of partial numberings |
PODC
2006
ACM
14 years 1 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
SIGSOFT
2009
ACM
14 years 8 months ago
2009
ACM
Software engineering researchers have long been interested in where and why bugs occur in code, and in predicting where they might turn up next. Historical bug-occurence data has ...
EACL
2006
ACL Anthology
13 years 9 months ago
2006
ACL Anthology
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...
PROLAMAT
1998
13 years 9 months ago
1998
Advanced manufacturing environments nowadays involve a number of cooperating heterogeneous nodes, where each node supports a distinct activity, and their joint efforts and informa...
AIIDE
2009
13 years 8 months ago
2009
Design of game worlds is becoming more and more laborintensive because of the increasing demand and complexity of content. This is being partially addressed by developing semi-aut...