Sciweavers

378 search results - page 5 / 76
» How Many Ways Can One Draw a Graph
Sort
View
VISSOFT
2005
IEEE
14 years 1 months ago
The Dominance Tree in Visualizing Software Dependencies
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
Raimar Falke, Raimund Klein, Rainer Koschke, Joche...
CORR
2000
Springer
95views Education» more  CORR 2000»
13 years 7 months ago
One Complexity Theorist's View of Quantum Computing
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
Lance Fortnow
INFOCOM
2003
IEEE
14 years 22 days ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
ACSC
2002
IEEE
14 years 13 days ago
Intelligent Agents for Automated One-to-Many e-Commerce Negotiation
Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current...
Iyad Rahwan, Ryszard Kowalczyk, H. H. Pham
EJC
2010
13 years 7 months ago
On loop identities that can be obtained by a nuclear identification
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...
Ales Drápal, Premysl Jedlicka