3823 search results - page 394 / 765 » Experiments with Random Projection |
109
click to vote
FLAIRS
2003
15 years 5 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
108
click to vote
OPODIS
2004
15 years 5 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
136
click to vote
IJCAI
2003
15 years 5 months ago
2003
There are two types of collaborative filtering (CF) systems, user-based and item-based. This paper introduces an item-based CF system for ranking derived from Linear Associative ...
146
click to vote
IJCAI
2003
15 years 5 months ago
2003
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
126
click to vote
AAAI
1996
15 years 5 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...