Sciweavers

1245 search results - page 80 / 249
» Playing with Conway's problem
Sort
View
ICTCS
2003
Springer
14 years 2 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
IPPS
2002
IEEE
14 years 1 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
SSD
2001
Springer
122views Database» more  SSD 2001»
14 years 1 months ago
Calendars, Time Granularities, and Automata
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, t...
Ugo Dal Lago, Angelo Montanari
FASE
2010
Springer
14 years 9 days ago
A Process to Effectively Identify "Guilty" Performance Antipatterns
Abstract. The problem of interpreting the results of software performance analysis is very critical. Software developers expect feedbacks in terms of architectural design alternati...
Vittorio Cortellessa, Anne Martens, Ralf Reussner,...
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
13 years 10 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...