9842 search results - page 375 / 1969 » The Complexity of the Matching-Cut Problem |
133
click to vote
ISCAS
2006
IEEE
15 years 10 months ago
2006
IEEE
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
146
click to vote
SAC
2005
ACM
15 years 10 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
159
click to vote
LSSC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
150
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
We present the result of our work on use of genetic programming for evolving social behavior of agents situated in inherently cooperative environment. We use predators-prey pursuit...
126
click to vote
IEAAIE
2001
Springer
15 years 8 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...