197 search results - page 30 / 40 » Some Topological Methods in Graph Coloring Theory |
IDEAL
2003
Springer
14 years 1 months ago
2003
Springer
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
SIGECOM
2009
ACM
14 years 3 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
NC
1998
13 years 9 months ago
1998
Many processes are composed of a n-fold repetition of some simpler process. If the whole process can be modeled with a neural network, we present a method to derive a model of the...
Publication
The space-time geometric structure of Maxwell’s equations is examined and a subset of them is found to define a pair of exact discrete time-stepping relations. The desirability ...
ISSAC
2009
Springer
14 years 3 months ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...