SODA
2004
ACM
14 years 1 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
IJCAI
2003
14 years 1 months ago
2003
Muhiagent systems (MAS) can "go down" for a large number of reasons, ranging from system malfunctions and power failures to malicious attacks. The placement of agents on...
IJCAI
2003
14 years 1 months ago
2003
In many applications of temporal reasoning we are in terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
SODA
2001
ACM
14 years 1 months ago
2001
ACM
SODA
2001
ACM
14 years 1 months ago
2001
ACM
Fast-converging methods for reconstructing phylogenetic trees require that the sequences characterizing the taxa be of only polynomial length, a major asset in practice, since rea...
SODA
2001
ACM
14 years 1 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
SODA
2001
ACM
14 years 1 months ago
2001
ACM
SODA
2001
ACM
14 years 1 months ago
2001
ACM
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
SODA
2001
ACM
14 years 1 months ago
2001
ACM
Clustering is of central importance in a number of disciplines including Machine Learning, Statistics, and Data Mining. This paper has two foci: 1 It describes how existing algori...
SODA
2001
ACM
14 years 1 months ago
2001
ACM