34181 search results - page 94 / 6837 » Computer system |
STACS
2010
Springer
15 years 8 months ago
2010
Springer
We study systems of equations of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a poly
111
Voted
CADE
2008
Springer
15 years 3 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
AAAI
2006
15 years 2 months ago
2006
Computational humor is a challenge with implications for many classical fields in AI such as, for example, natural language processing, intelligent human-computer interaction, rea...
136
click to vote
HIPC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper formulates the job allocation problem in distributed systems with bandwidth-constrained nodes. The bandwidth limitations of the nodes play an important role in...
139
Voted
WSTFEUS
2003
IEEE
15 years 6 months ago
2003
IEEE
Determining physical location of indoor objects is one of the key issues in development of context-aware applications in ubiquitous computing environment. This is mainly because c...