Sciweavers

1487 search results - page 230 / 298
» Two Kinds of Metonymy
Sort
View
PODC
2006
ACM
14 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
ACSC
2002
IEEE
14 years 20 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
ASAP
2002
IEEE
170views Hardware» more  ASAP 2002»
14 years 20 days ago
Reviewing 4-to-2 Adders for Multi-Operand Addition
Recently there has been quite a number of papers discussing the use of redundant 4-to-2 adders for the accumulation of partial products in multipliers, claiming one type to be sup...
Peter Kornerup
IPPS
2000
IEEE
14 years 2 days ago
Reduction Optimization in Heterogeneous Cluster Environments
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
Pangfeng Liu, Da-Wei Wang
POPL
2000
ACM
14 years 1 days ago
Enforcing Trace Properties by Program Transformation
We propose an automatic method to enforce trace properties on programs. The programmer specifies the property separately from the program; a program transformer takes the program...
Thomas Colcombet, Pascal Fradet