6142 search results - page 362 / 1229 » The Complexity of Partition Functions |
193
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
149
click to vote
EDOC
2004
IEEE
15 years 10 months ago
2004
IEEE
A major contributing factor to the complexity of creating and evolving distributed systems is the tangling of middleware-specific functionality with core business functionality in...
174
click to vote
IJCAI
2003
15 years 8 months ago
2003
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
155
click to vote
SIGSOFT
2009
ACM
16 years 7 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
170
click to vote
STACS
2007
Springer
16 years 24 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...