Maolin Tang

Gateways placement in backbone wireless mesh networks (2009)

Network RTK (Real-Time Kinematic) is a technology that is based on GPS (Global Positioning System) or more generally on GNSS (Global Navigation Satellite System) measurements to achieve...

A genetic algorithm for the multi-source and multi-sink minimum vertex cut problem and its applications (2009)

This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies...

Tang, Maolin, Fidge, Colin J.

We present a new penalty-based genetic algorithm for the multi-source and multi-sink minimum vertex cut problem, and illustrate the algorithm’s usefulness with two real-world applications. It is...

QoS-aware reference station placement for regional network RTK (2009)

Gateways placement in backbone wireless mesh networks (2009)

Network RTK (Real-Time Kinematic) is a technology that is based on GPS (Global Positioning System) or more generally on GNSS (Global Navigation Satellite System) measurements to achieve...

QoS-aware reference station placement for regional network RTK (2009)

This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies...

Gateways placement in backbone wireless mesh networks (2009)

Network RTK (Real-Time Kinematic) is a technology that is based on GPS (Global Positioning System) or more generally on GNSS (Global Navigation Satellite System) measurements to achieve...

A genetic algorithm for the multi-source and multi-sink minimum vertex cut problem and its applications (2009)

This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies...

Tang, Maolin, Fidge, Colin J.

We present a new penalty-based genetic algorithm for the multi-source and multi-sink minimum vertex cut problem, and illustrate the algorithm’s usefulness with two real-world applications. It is...

Multi-vehicles interaction graph model for cooperative collision warning system (2009)

Sebastian, Alvin, Tang, Maolin, Feng, Yanming, Looi, Mark

Cooperative collision warning system for road vehicles, enabled by recent advances in positioning systems and wireless communication technologies, can potentially reduce traffic accident...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2008)

Maolin Tang

Floorplanning is an important problem in Very Large-Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

An Evolutionary Learning Approach for Adaptive Negotiation Agents (2008)

Raymond Y. K, Stephen W, Maolin Tang, On Wong, Stephen W. Milliner, ...

Abstract. Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by...

QoS-Based Web Service Scheduling Accommodating Inter-Service Dependencies Using Minimal-Conflict Hill-Climbing Repair Genetic Algorithm (2008)

Ai, Lifeng, Tang, Maolin

In the filed of semantic grid, QoS-based Web service scheduling for workflow optimization is an important problem.However, in semantic and service rich environment like semantic grid, the emergence...

A Penalty-based Genetic Algorithm for QoS-AwareWeb Service Composition with Inter-Service Dependencies and Conflicts (2008)

Ai, Lifeng, Tang, Maolin

In Web service based systems, new value-added Web services can be constructed by integrating existing Web services. A Web service may have many implementations, which are functionally identical, but...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Floorplanning is an important problem in very largescale integrated-circuit (VLSI) design automation as it determinesthe performance, size, yield, and reliability of VLSI chips. Fromthe computational...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Floorplanning is an important problem in very largescale integrated-circuit (VLSI) design automation as it determinesthe performance, size, yield, and reliability of VLSI chips. Fromthe computational...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

A Reference Station Placement Scheme in Deployment of Network Real-Time Kinematic Positioning Systems (2007)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

Tang, Maolin, Feng, Yanming, Burnett, Linda D., Hayward, Ross F., Raymond, Kerry

Reference station placement is an important problem when deploying a network based real time kinematic system. It directly affects the cost and performance of the system. However, there is lack of a...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applyingdomain ontologies to facilitate communications amongcomputers and human users, engineering of these ontologiesturns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

A Reference Station Placement Scheme in Deployment of Network Real-Time Kinematic Positioning Systems (2007)

Floorplanning is an important problem in Very Large-Scale Integrated-circuit (VLSI) design automation as it determinesthe performance, size, yield and reliability of VLSIchips. From the computational...

Tang, Maolin, Feng, Yanming

Reference station placement is an important problem when deploying anetwork based real time kinematic system. It directly affects the cost andperformance of the system. However, there is lack of a...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

A Reference Station Placement Scheme in Deployment of Network Real-Time Kinematic Positioning Systems (2007)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

Tang, Maolin, Feng, Yanming

Reference station placement is an important problem when deploying a network based real time kinematic system. It directly affects the cost and performance of the system. However, there is lack of a...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

A Reference Station Placement Scheme in Deployment of Network Real-Time Kinematic Positioning Systems (2007)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

Tang, Maolin, Feng, Yanming, Burnett, Linda D., Hayward, Ross F., Raymond, Kerry

Reference station placement is an important problem when deploying a network based real time kinematic system. It directly affects the cost and performance of the system. However, there is lack of a...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Towards Context-Sensitive Domain Ontology Extraction (2007)

Floorplanning is an important problem in very large scale integrated-circuit (VLSI) design automation as it determines the performance, size, yield, and reliability of VLSI chips. From the...

Lau, Raymond Y.K., Hao, Jin-Xing, Tang, Maolin, Zhou, Xujuan

Although there has been a surge of interest in applying domain ontologies to facilitate communications among computers and human users, engineering of these ontologies turns out to be very labor...

A Parallel Genetic Algorithm for Floorplan Area Optimization (2007)

An Evolutionary Learning Approach for Adaptive Negotiation Agents (2006)

Floorplanning is an important problem in Very Large- Scale Integrated-circuit (VLSI) design automation as it determines the performance, size, yield and reliability of VLSI chips. From the...

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

An Evolutionary Learning Approach for Adaptive Negotiation Agents (2006)

Lau, R.Y.K., Tang, Maolin, Wong, On

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

An evolutionary learning approach for adaptive negotiation agents (2006)

Lau, Raymond Y. K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-business is challenging because negotiations in such a context are characterized by combinatorially...

An evolutionary learning approach for adaptive negotiation agents (2006)

Lau, Raymond Y. K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-business is challenging because negotiations in such a context are characterized by combinatorially...

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

An Evolutionary Learning Approach for Adaptive Negotiation Agents (2006)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

An Evolutionary Learning Approach for Adaptive Negotiation Agents (2006)

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

An Evolutionary Learning Approach for Adaptive Negotiation Agents (2006)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

Evolutionary learning approach for adaptive negotiation agents (2006)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

An Evolutionary Learning Approach for Adaptive Negotiation Agents (2006)

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

An Evolutionary Learning Approach for Adaptive Negotiation Agents (2006)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

An evolutionary learning approach for adaptive negotiation agents (2006)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

An evolutionary learning approach for adaptive negotiation agents (2006)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

An evolutionary learning approach for adaptive negotiation agents (2006)

Lau, Raymond Y.K., Tang, Maolin, Wong, On, Milliner, Stephen W., Chen, Yi-Ping Phoebe

Developing effective and efficient negotiation mechanisms for real-world applications such as e-Business is challenging since negotiations in such a context are characterised by combinatorially...

A Hybrid Estimation of Distribution Algorithm for the Minimal Switching Graph Problem (2006)

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem—a combinatorial optimization problem in integrated circuit design automation. From a computational...

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a...

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representationof the constrained via minimization problem — a combinatorialoptimization problem in integrated circuit design automation. Froma...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a...

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a...

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a...

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a...

An adaptive genetic algorithm for the minimal switching graph problem (2005)

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

A genetic algorithm for VLSI floorplanning using O-Tree representation (2005)

Minimal Switching Graph (MSG) is a graph-theoretic representation of the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. From a...

Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of...

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about theopponents, and volatile...

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile...

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile...

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile...

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

A Model for Developing Web-based Distributed and Parallel Genetic Algorithms (2004)

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile...

A Comparative Study of Internet-Based Parallel and Distributed Genetic Algorithms (2004)

A Model for Developing Web-based Distributed and Parallel Genetic Algorithms (2004)

A Comparative Study of Internet-Based Parallel and Distributed Genetic Algorithms (2004)

A Genetic Algorithm for Hard Module and Non-Slicing VLSI Floorplanning (2004)

Mining Contextual Knowledge for Context-Sensitive Recommendations (2004)

A Genetic Algorithm for Hard Module and Non-Slicing VLSI Floorplanning (2004)

Mining Contextual Knowledge for Context-Sensitive Recommendations (2004)

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

A Model for Developing Web-based Distributed and Parallel Genetic Algorithms (2004)

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile...

A Comparative Study of Internet-Based Parallel and Distributed Genetic Algorithms (2004)

A Genetic Algorithm for Hard Module and Non-Slicing VLSI Floorplanning (2004)

Mining Contextual Knowledge for Context-Sensitive Recommendations (2004)

A slicing structure representation for the multi-layer floorplan layout problem (2004)

Switchbox routing is an intractable problem in very large scale integrated-circuit (VLSI) physical design automation. From a computational point of view, the problem is NP-complete. This paper...

Towards genetically optimised responsive negotiation agents (2004)

This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorplanning problem. The original contribution is a three dimensional slicing structure representation...

A Model for Developing Web-based Distributed and Parallel Genetic Algorithms (2004)

Real-world negotiations are characterised by combinatorially complex negotiation spaces, tough deadlines, bounded agent rationality, very limited information about the opponents, and volatile...

A Comparative Study of Internet-Based Parallel and Distributed Genetic Algorithms (2004)

A Genetic Algorithm for Hard Module and Non-Slicing VLSI Floorplanning (2004)

Mining Contextual Knowledge for Context-Sensitive Recommendations (2004)

A convergence model for asynchronous parallel genetic algorithms (2003)

A convergence model for asynchronous parallel genetic algorithms (2003)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A convergence model for asynchronous parallel genetic algorithms (2003)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A convergence model for asynchronous parallel genetic algorithms (2003)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A convergence model for asynchronous parallel genetic algorithms (2003)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A convergence model for asynchronous parallel genetic algorithms (2003)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A convergence model for asynchronous parallel genetic algorithms (2003)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A convergence model for asynchronous parallel genetic algorithms (2003)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A convergence model for asynchronous parallel genetic algorithms (2003)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A Configurable Shortest Path Algorithm for Three-Dimensional Grid Graphs with Applications to VLSI Multilayer Routing (2002)

This paper describes and verifies a convergence model that allows the islands in a parallel genetic algorithm to run at different speeds, and to simulate the effects of communication or machine...

A Design Pattern for Web-Based Parallel Genetic Algorithms (2002)

A Configurable Shortest Path Algorithm for Three-Dimensional Grid Graphs with Applications to VLSI Multilayer Routing (2002)

A Design Pattern for Web-Based Parallel Genetic Algorithms (2002)

A Configurable Shortest Path Algorithm for Three-Dimensional Grid Graphs with Applications to VLSI Multilayer Routing (2002)

A Design Pattern for Web-Based Parallel Genetic Algorithms (2002)

A Configurable Shortest Path Algorithm for Three-Dimensional Grid Graphs with Applications to VLSI Multilayer Routing (2002)

A Design Pattern for Web-Based Parallel Genetic Algorithms (2002)

A practical and efficient approach to the constrained via minimization problem (2001)

A practical and efficient approach to the constrained via minimization problem (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...

A practical and efficient approach to the constrained via minimization problem (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...

A practical and efficient approach to the constrained via minimization problem (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...

A practical and efficient approach to the constrained via minimization problem (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...

A practical and efficient approach to the constrained via minimization problem (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...

A practical and efficient approach to the constrained via minimization problem (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...

Knowledge-based Genetic Algorithm for Layer Assignment (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...

Knowledge-based Genetic Algorithm for Layer Assignment (2001)

A practical and efficient approach to the constrained via minimization problem (2001)

Knowledge-based Genetic Algorithm for Layer Assignment (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...

A practical and efficient approach to the constrained via minimization problem (2001)

Knowledge-based Genetic Algorithm for Layer Assignment (2001)

This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a...