Sciweavers

1650 search results - page 169 / 330
» The HOM problem is decidable
Sort
View
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 8 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...
DAGM
2007
Springer
15 years 8 months ago
Image-Matching for Revision Detection in Printed Historical Documents
Abstract. In the research area of historical documents it is of high interest to reconstruct the process of the emergence of a historical typesetted document. Therefore, the chrono...
Joost van Beusekom, Faisal Shafait, Thomas M. Breu...
ESOP
2009
Springer
15 years 8 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
ATAL
2006
Springer
15 years 8 months ago
On Efficient Procedures for Multi-issue Negotiation
This paper studies bilateral, multi-issue negotiation between self-interested agents with deadlines. There are a number of procedures for negotiating the issues and each of these g...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
CSMR
2004
IEEE
15 years 8 months ago
Architecture-Aware Adaptive Clustering of OO Systems
The recovery of software architecture is a first important step towards re-engineering a software system. Architecture recovery usually involves clustering. The problem with curre...
Markus Bauer, Mircea Trifu