6575 search results - page 707 / 1315 » Specializing visualization algorithms |
223
click to vote
DC
2002
15 years 7 months ago
2002
Message ordering is a fundamental abstraction in distributed systems. However, ordering guarantees are usually purely "syntactic," that is, message "semantics" ...
192
click to vote
ISCI
2000
15 years 7 months ago
2000
This paper discusses a model of quantum associative memory which generalizes the completing associative memory proposed by Ventura and Martinez. Similar to this model, our system ...
178
click to vote
JAIR
2000
15 years 7 months ago
2000
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
192
click to vote
EOR
2002
15 years 7 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
181
click to vote
JCO
1998
15 years 6 months ago
1998
We consider traveling salesman problems (TSPs) with a permuted Monge matrix as cost matrix where the associated patching graph has a specially simple structure: a multistar, a mult...