Sciweavers

2783 search results - page 546 / 557
» The Nature Of Near-Synonymic Relations
Sort
View
JUCS
2008
120views more  JUCS 2008»
14 years 9 months ago
Guaranteeing Seamless Mobility with User Redials and Automatic Handover Retrials
: In communication systems that guarantee seamless mobility of users across service areas, repeated attempts occur as a result of user behavior but also as automatic retries of blo...
José Manuel Giménez-Guzmán, M...
LOGCOM
2008
94views more  LOGCOM 2008»
14 years 9 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
MANSCI
2008
119views more  MANSCI 2008»
14 years 9 months ago
Service-Level Differentiation in Call Centers with Fully Flexible Servers
We study large-scale service systems with multiple customer classes and many statistically identical servers. The following question is addressed: How many servers are required (s...
Itay Gurvich, Mor Armony, Avishai Mandelbaum
79
Voted
SIAMCO
2008
130views more  SIAMCO 2008»
14 years 9 months ago
Important Moments in Systems and Control
The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence on the...
Christopher I. Byrnes, Anders Lindquist
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
14 years 9 months ago
Plottable Real Number Functions and the Computable Graph Theorem
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
Vasco Brattka