3211 search results - page 436 / 643 » On the Grundy Number of a Graph |
258
click to vote
BVAI
2007
Springer
16 years 22 days ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
187
click to vote
COCOA
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
171
click to vote
COLT
2007
Springer
16 years 22 days ago
2007
Springer
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
155
click to vote
KES
2007
Springer
16 years 21 days ago
2007
Springer
In spatial graphs with a vast number of nodes, it is difficult to compute a solution to graph optimisation problems. We propose an approach using meta-level agents for multi-agents...
162
click to vote
TCC
2007
Springer
16 years 20 days ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...