2354 search results - page 262 / 471 » A Common-Sense Theory of Time |
160
click to vote
AAAI
2008
15 years 9 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
161
click to vote
WSC
2008
15 years 9 months ago
2008
Understanding how the structure of a network evolves over time is one of the most interesting and complex topics in the field of social networks. In our attempt to model the dynam...
189
click to vote
AUTONOMICS
2008
ACM
15 years 8 months ago
2008
ACM
A goal of computing and networking systems is to limit administrative requirements for users and operators. A technical systems should be able to configure itself as much as possi...
172
click to vote
CSC
2008
15 years 8 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...
158
click to vote
OPODIS
2008
15 years 8 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...