Sciweavers

405 search results - page 40 / 81
» On the Complexity of Global Constraint Satisfaction
Sort
View
ICALT
2008
IEEE
15 years 5 months ago
A Framework for Semantic Group Formation
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
Asma Ounnas, Hugh C. Davis, David E. Millard

Publication
518views
16 years 10 months ago
Procurement of Global Logistics Services Using Combinatorial Auction
Global logistics flows have increased dramatically in recent years due to the globalization in the world economy. It is more complex than the domestic logistics, consisting of mult...
Nikesh Kumar Srivastava, N. Viswanadham, and S. Ka...
WISEC
2009
ACM
15 years 5 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
CP
2011
Springer
13 years 11 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
BIRTHDAY
2003
Springer
15 years 4 months ago
Comet in Context
Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supplychain management, and resource allocation. They often give...
Laurent Michel, Pascal Van Hentenryck