787 search results - page 56 / 158 » Polynomial Constants are Decidable |
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checki...
ISSAC
2005
Springer
14 years 1 months ago
2005
Springer
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...
JIIS
2008
13 years 8 months ago
2008
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
1 The article presents an online relevancy tuning method using explicit user feedback. The author developed and tested a method of words' weights modification based on search ...