Sciweavers

433 search results - page 70 / 87
» On stabilizers of infinite words
Sort
View
ZEUS
2010
153views Communications» more  ZEUS 2010»
13 years 9 months ago
Estimating costs of a service
When designing a publicly available Web service, a service designer has to take care of costs and revenue caused by this services. In the very beginning possible partners might onl...
Christian Gierds, Jan Sürmeli
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 9 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
BSL
2006
114views more  BSL 2006»
13 years 8 months ago
Schemata: The Concept of Schema in the History of Logic
Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the...
John Corcoran
JUCS
2008
140views more  JUCS 2008»
13 years 7 months ago
The Computable Multi-Functions on Multi-represented Sets are Closed under Programming
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...
Klaus Weihrauch