Sciweavers

1421 search results - page 35 / 285
» Satisfying KBO Constraints
Sort
View
KDID
2004
149views Database» more  KDID 2004»
13 years 9 months ago
Database Transposition for Constrained (Closed) Pattern Mining
Abstract. Recently, different works proposed a new way to mine patterns in databases with pathological size. For example, experiments in genome biology usually provide databases wi...
Baptiste Jeudy, François Rioult
CP
2011
Springer
12 years 8 months ago
Hierarchically Nested Convex VCSP
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
Martin C. Cooper, Stanislav Zivny
PRICAI
1998
Springer
14 years 9 days ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
INFOCOM
2010
IEEE
13 years 6 months ago
Joint Routing and Scheduling in Multi-hop Wireless Networks with Directional Antennas
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
Partha Dutta, Vivek Mhatre, Debmalya Panigrahi, Ra...
WINE
2010
Springer
109views Economy» more  WINE 2010»
13 years 6 months ago
Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences
In this paper, we characterize strategy-proof voting rules when the set of alternatives has a multi-issue structure, and the voters' preferences are represented by acyclic CP-...
Lirong Xia, Vincent Conitzer