58 search results - page 7 / 12 » Weakly maximal decidable structures |
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
The two main questions in coalition games are 1) what coalitions should form and 2) how to distribute the value of each coalition between its members. When a game is not superaddit...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
CGF
2008
13 years 7 months ago
2008
We present an unbiased method for generating caustic lighting using importance sampled Path Tracing with Caustic Forecasting. Our technique is part of a straightforward rendering ...
PODS
1999
ACM
13 years 11 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
WABI
2001
Springer
13 years 12 months ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...