335 search results - page 21 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
136
click to vote
DAC
2000
ACM
15 years 9 months ago
2000
ACM
In many modern designs, timing is either a key optimization goal and/or a mandatory constraint. We propose the first intellectual property protection technique using watermarking ...
149
Voted
IPPS
2005
IEEE
15 years 10 months ago
2005
IEEE
— In the oblivious path selection problem, each packet in the network independently chooses a path, which is an important property if the routing algorithm is to be independent o...
149
click to vote
WALCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
We present two space-efficient algorithms. First, we show how to report a simple path between two arbitrary nodes in a given tree. Using a technique called “computing instead of ...
122
Voted
MP
2008
15 years 4 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
132
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...