Sciweavers

1480 search results - page 116 / 296
» Ants can solve constraint satisfaction problems
Sort
View
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
15 years 11 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
IJCAI
2007
15 years 7 months ago
Arc Consistency during Search
Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Pr...
Chavalit Likitvivatanavong, Yuanlin Zhang, Scott S...
COR
2007
183views more  COR 2007»
15 years 6 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...
Thierry Mautor, Edith Naudin
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 6 months ago
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
António Morgado, João P. Marques Sil...
ICASSP
2011
IEEE
14 years 10 months ago
A convex approximation approach to weighted sum rate maximization of multiuser MISO interference channel under outage constraint
This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weig...
Wei-Chiang Li, Tsung-Hui Chang, Che Lin, Chong-Yun...