436 search results - page 32 / 88 » Decomposing constraint systems: equivalences and computation... |
CP
1997
Springer
14 years 24 days ago
1997
Springer
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
VLDB
1999
ACM
14 years 26 days ago
1999
ACM
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract— We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix,...
SIGMOD
2008
ACM
13 years 8 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— This paper considers jointly optimal design of crosslayer congestion control, routing and scheduling for ad hoc wireless networks. We first formulate the rate constrai...