1686 search results - page 197 / 338 » Programs as polygraphs: computability and complexity |
249
Voted
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
146
click to vote
EEE
2005
IEEE
15 years 9 months ago
2005
IEEE
As the IT industry is becoming more and more interested in service oriented business models and upcoming technologies like Web Services or Grid Computing, the need for automated c...
138
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
167
Voted
HICSS
2003
IEEE
15 years 9 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
151
click to vote
COMPULOG
1999
Springer
15 years 8 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...