9405 search results - page 278 / 1881 » Computing a Model of Set Theory |
134
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
130
click to vote
LICS
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
136
Voted
ISMIS
2003
Springer
15 years 9 months ago
2003
Springer
As broadband access to the Internet becomes pervasive, the need for a 24 hours a day, seven days a week (24x7) interface within the client devices, requires a level of sophisticati...
120
Voted
TACS
1991
Springer
15 years 8 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...
130
click to vote
DSS
2006
15 years 4 months ago
2006
In order to overcome some unavoidable factors, like shift of the part, that influence the crisp neural networks' recognition, the present study is dedicated in developing a n...