Sciweavers

53 search results - page 10 / 11
» Practical methods for constructing suffix trees
Sort
View
AAAI
2008
13 years 9 months ago
Resource Constrained Distributed Constraint Optimization with Virtual Variables
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
Toshihiro Matsui, Hiroshi Matsuo, Marius Silaghi, ...
CP
2007
Springer
14 years 1 months ago
A Compression Algorithm for Large Arity Extensional Constraints
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
George Katsirelos, Toby Walsh
INFOCOM
2010
IEEE
13 years 5 months ago
Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...
János Tapolcai, Lajos Rónyai, Pin-Ha...
SMALLTALK
2007
Springer
14 years 1 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 7 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...