1142 search results - page 165 / 229 » Approximability of Clausal Constraints |
184
click to vote
TON
2008
15 years 6 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
202
click to vote
NECO
1998
15 years 6 months ago
1998
three different levels of abstraction: detailed models including ctivity dynamics, weight dynamics that abstract from the neural activity dynamics by an adiabatic approximation, an...
161
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
160
click to vote
INFORMS
2010
15 years 4 months ago
2010
We design and implement an intensity-modulated radiation therapy (IMRT) plan generation technology that effectively and efficiently optimizes beam geometry as well as beam intens...
156
click to vote
PVLDB
2010
15 years 4 months ago
2010
A foreign/primary key relationship between relational tables is one of the most important constraints in a database. From a data analysis perspective, discovering foreign keys is ...