Sciweavers

4926 search results - page 483 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ATAL
2010
Springer
15 years 4 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
ICONIP
2008
15 years 5 months ago
Neurocognitive Approach to Creativity in the Domain of Word-Invention
One of the simplest creative act is the invention of a new word that captures some characteristics of objects or processes, for example industrial or software products, activity of...
Maciej Pilichowski, Wlodzislaw Duch
IPPS
2002
IEEE
15 years 8 months ago
A Recursion-Based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks
: A novel broadcast technique for wormhole-routed mesh and torus parallel computers based on recursion is presented in this paper. It works by partitioning the graph into several s...
Xiaotong Zhuang, Vincenzo Liberatore
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
15 years 7 months ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
15 years 10 months ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh