1071 search results - page 111 / 215 » Theories of Automatic Structures and Their Complexity |
DL
1994
Springer
14 years 10 days ago
1994
Springer
Digital Libraries will hold huge amounts of text and other forms of information. For the collections to be maximally useful, they must be highly organized with useful indexes and ...
ACMICEC
2006
ACM
14 years 10 hour ago
2006
ACM
In this paper, we look at a supply chain of commodity goods where customer demand is uncertain and partly based on reputation, and where raw material replenishment is uncertain in...
ATAL
2006
Springer
14 years 3 hour ago
2006
Springer
Multiagent resource allocation is a timely and exciting area of research at the interface of Computer Science and Economics. One of the main challenges in this area is the high co...
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
PRDC
2006
IEEE
14 years 2 months ago
2006
IEEE
Dependable systems are usually designed with multiple instances of components or logical processes, and often possess symmetries that may be exploited in model-based evaluation. T...