1487 search results - page 230 / 298 » Two Kinds of Metonymy |
182
click to vote
PODC
2006
ACM
16 years 11 days ago
2006
ACM
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...
191
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
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...
203
click to vote
ASAP
2002
IEEE
15 years 11 months ago
2002
IEEE
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...
149
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-the-shelf processors become cheaper and faster, ...
233
click to vote
POPL
2000
ACM
15 years 10 months ago
2000
ACM
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...