4066 search results - page 225 / 814 » Almost Complete Sets |
131
click to vote
IJCAI
1989
15 years 7 months ago
1989
We are interested here in the design of a very efficient Time-Map Manager, able to deal with a large knowledge-base of several thou sand time-tokens in demanding applications su...
162
click to vote
AI
2008
Springer
15 years 6 months ago
2008
Springer
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper shows how to reconstruct a ranking f...
153
click to vote
ENTCS
2006
15 years 6 months ago
2006
The article introduces an extension of the well-known conformance relation ioco on labeled transition systems (LTS) with refused inputs and forbidden actions. This extension helps...
130
click to vote
JAIR
2008
15 years 6 months ago
2008
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
191
click to vote
NETWORKS
2008
15 years 6 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...