Sciweavers

2001 search results - page 112 / 401
» Local solutions for global problems in wireless networks
Sort
View
NIPS
2007
15 years 7 months ago
Multi-Task Learning via Conic Programming
When we have several related tasks, solving them simultaneously is shown to be more effective than solving them individually. This approach is called multi-task learning (MTL) and...
Tsuyoshi Kato, Hisashi Kashima, Masashi Sugiyama, ...
IPOM
2005
Springer
15 years 11 months ago
Comprehensive Solution for Anomaly-Free BGP
The Internet consists of many self-administered and inter-connected AutonomousSystems(ASms). ASms exchangeinter-AS routing information with each other via the Border Gateway Protoc...
Ravi Musunuri, Jorge Arturo Cobb
169
Voted
IJCAI
1993
15 years 7 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
162
Voted
MOBIHOC
2003
ACM
16 years 5 months ago
A MAC protocol for full exploitation of directional antennas in ad-hoc wireless networks
Directional antennas in ad hoc networks offer many benefits compared with classical omnidirectional antennas. The most important include significant increase of spatial reuse, cov...
Thanasis Korakis, Gentian Jakllari, Leandros Tassi...
AI
2008
Springer
15 years 6 months ago
Properties of tree convex constraints
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
Yuanlin Zhang, Eugene C. Freuder